Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLinear syzygies, hyperbolic Coxeter groups and regularity
352
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We show that the virtual cohomological dimension of a Coxeter group is essentially the regularity of the Stanley--Reisner ring of its nerve. Using this connection between geometric group theory and commutative algebra, as well as techniques from the theory of hyperbolic Coxeter groups, we study the behavior of the Castelnuovo--Mumford regularity of square-free quadratic monomial ideals. We construct examples of such ideals which exhibit arbitrarily high regularity after linear syzygies for arbitrarily many steps. We give a doubly logarithmic bound on the regularity as a function of the number of variables if these ideals are Cohen--Macaulay.
rate research
Read More
We show that for every positive integer R there exist monomial ideals generated in degree two, with linear syzygies, and regularity of the quotient equal to R. Such examples can not be found among Gorenstein ideals since the regularity of their quotients is at most four. We also show that for most monomial ideals generated in degree two and with linear syzygies the regularity grows at most doubly logarithmically in the number of variables.
A graph $X$ is defined inductively to be $(a_0,dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be highly regular (HR) of level $n$ if $a_{n-1} eq 0$. Chapman, Linial and Peled studied HR-graphs of level 2 and provided several methods to construct families of graphs which are expanders globally and locally. They ask whether such HR-graphs of level 3 exist. In this paper we show how the theory of Coxeter groups, and abstract regular polytopes and their generalisations, can lead to such graphs. Given a Coxeter system $(W,S)$ and a subset $M$ of $S$, we construct highly regular quotients of the 1-skeleton of the associated Wythoffian polytope $mathcal{P}_{W,M}$, which form an infinite family of expander graphs when $(W,S)$ is indefinite and $mathcal{P}_{W,M}$ has finite vertex links. The regularity of the graphs in this family can be deduced from the Coxeter diagram of $(W,S)$. The expansion stems from applying superapproximation to the congruence subgroups of the linear group $W$. This machinery gives a rich collection of families of HR-graphs, with various interesting properties, and in particular answers affirmatively the question asked by Chapman, Linial and Peled.
We define a large class of abstract Coxeter groups, that we call $infty$--spanned, and for which the word growth rate and the geodesic growth rate appear to be Perron numbers. This class contains a fair amount of Coxeter groups acting on hyperbolic spaces, thus corroborating a conjecture by Kellerhals and Perren. We also show that for this class the geodesic growth rate strictly dominates the word growth rate.
These are the notes of the lectures of the author at the 2013 CIME/CIRM summer school on Combinatorial Algebraic Geometry. Koszul algebras, introduced by Priddy, are positively graded K-algebras R whose residue field K has a linear free resolution as an R-module. The first part of the notes is devoted to the introduction of Koszul algebras and their characterization in terms of Castelnuovo-Mumford regularity. In the second part we discuss recernt results on the syzygies of Koszul algebras. Finally in the last part we discuss the Koszul property of Veronese algebras and of algebras associated with collections of hyperspaces.
Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal Gorenstein. Indeed, these characterizations are consequences of an explicit formula we obtain for the regularity of the binomial edge ideal of the join product of two graphs. Finally, by using our regularity formula, we discuss some open problems in the literature. In particular we disprove a conjecture in cite{CDI} on the regularity of weakly closed graphs.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
