To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By generalizing the notion of a tree from graphs to simplicial complexes, we show that ideals associated to trees satisfy sliding depth condition, and therefore have normal and Cohen-Macaulay Rees rings. We also discuss connections with the theory of Stanley-Reisner rings.
This paper uses dualities between facet ideal theory and Stanley-Reisner theory to show that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay. The proof involves showing that the Alexander dual (or the cover dual, as we call it here) of a simplicial tree is a componentwise linear ideal. We conclude with additional combinatorial properties of simplicial trees.
We consider ideals generated by general sets of $m$-minors of an $m\times n$-matrix of indeterminates. The generators are identified with the facets of an $(m-1)$-dimensional pure simplicial complex. The ideal generated by the minors corresponding to the facets of such a complex is called a determinantal facet ideal. Given a pure simplicial complex $Δ$, we discuss the question when the generating minors of its determinantal facet ideal $J_Δ$ form a Gröbner basis and when $J_Δ$ is a prime ideal.
We consider the face ideal associated to a line-type simplicial complex. We compute the \texttt{depth} and the \texttt{sdepth} for its quotient ring. In particular, the facet ideal and its quotient ring satisfy the Stanley inequality.
In this paper, we provide a simple proof for the fact that two simplicial complexes are isomorphic if and only if their associated Stanley-Reisner rings, or their associated facet rings are isomorphic as $K$-algebras. As a consequence, we show that two graphs are isomorphic if and only if their associated edge rings are isomorphic as $K$-algebras. Based on an explicit $K$-algebra isomorphism of two Stanley-Reisner rings, or facet rings or edge rings, we present a fast algorithm to find explicitly the isomorphism of the associated simplicial complexes, or graphs.
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a criterion for the Cohen-Macaulayness of facet ideals of simplicial trees. Along the way, we generalize several concepts from graph theory to simplicial complexes.
Using the existence of a good leaf in every simplicial tree, we order the facets of a simplicial tree in order to find combinatorial information about the Betti numbers of its facet ideal. Applications include an Eliahou-Kervaire splitting of the ideal, as well as a refinement of a recursive formula of Hà and Van Tuyl for computing the graded Betti numbers of simplicial trees.
We give a sufficient condition for a monomial ideal to have a nonzero Betti number in each multidegree. In the case of facet ideals of simplicial forests, this condition becomes a necessary one and it allows us to characterize Betti numbers, projective dimension and regularity of such ideals combinatorially. Our condition is expressed in terms of minimal facet covers of simplicial complexes.
We generalize the concept of a cycle from graphs to simplicial complexes. We show that a simplicial cycle is either a sequence of facets connected in the shape of a circle, or is a cone over such a structure. We show that a simplicial tree is a connected cycle-free simplicial complex, and use this characterization to produce an algorithm that checks in polynomial time whether a simplicial complex is a tree. We also present an efficient algorithm for checking whether a simplicial complex is grafted, and therefore Cohen-Macaulay.
We survey some recent results on the minimal graded free resolution of a square-free monomial ideal. The theme uniting these results is the point-of-view that the generators of a monomial ideal correspond to the maximal faces (the facets) of a simplicial complex Δ.
We give a description of a new Macaulay2 package called SimplicialPosets. This package provides functions for working with simplicial posets and calculating their generalized Stanley-Reisner ideals. For practical purposes, we also introduce of a new random model for a class of simplicial posets which generalizes existing models for random simplicial complexes such as the Kahle model.
Let $L_n$ be a line graph with $n$ edges and $\F(L_n)$ the facet ideal of its matching complex. In this paper, we provide the irreducible decomposition of $\F(L_n)$ and some exact formulas for the projective dimension and the regularity of $\F(L_n)$.
For a simplicial complex $Δ$, the affect of the expansion functor on combinatorial properties of $Δ$ and algebraic properties of its Stanley-Reisner ring has been studied in some previous papers. In this paper, we consider the facet ideal $I(Δ)$ and its Alexander dual which we denote by $J_Δ$ to see how the expansion functor alter the algebraic properties of these ideals. It is shown that for any expansion $Δ^α$ the ideals $J_Δ$ and $J_{Δ^α}$ have the same total Betti numbers and their Cohen-Macaulayness are equivalent, which implies that the regularities of the ideals $I(Δ)$ and $I(Δ^α)$ are …
In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by S. Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determine the projective dimension and the regularity of I if the tree is 1-dimensional, show that the graded Betti numbers of I satisfy an alternating sum property if the tree is connected in codimension 1, …
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient conditions for a graph to be Hamiltonian. We introduce a hierarchy of combinatorial properties for simplicial complexes that generalize unit-interval, interval, and co-comparability graphs. We connect these properties to the already existing notions of determinantal facet ideals and Hamiltonian paths in simplicial complexes. Some important consequences of our…
In this paper we introduce the class of ordered homomorphism ideals and prove that these ideals admit minimal cellular resolutions constructed as homomorphism complexes. As a key ingredient of our work, we introduce the class of cointerval simplicial complexes and investigate their combinatorial and topological properties. As a concrete illustration of these structural results, we introduce and study nonnesting monomial ideals, an interesting family of combinatorially defined ideals.
We investigate generalized notions of the nerve complex for the facets of a simplicial complex. We show that the homologies of these higher nerve complexes determine the depth of the Stanley-Reisner ring $k[Δ]$ as well as the $f$-vector and $h$-vector of $Δ$. We present, as an application, a formula for computing regularity of monomial ideals.
We explore resolutions of monomial ideals supported by simplicial trees. We argue that since simplicial trees are acyclic, the criterion of Bayer, Peeva and Sturmfels for checking if a simplicial complex supports a free resolution of a monomial ideal reduces to checking that certain induced subcomplexes are connected. We then use results of Peeva and Velasco to show that every simplicial tree appears as the Scarf complex of a monomial ideal, and hence supports a minimal resolution. We also provide a way to construct smaller Scarf ideals than those constructed by Peeva and Velasco.
We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and Frobenius number of random semigroups. Our results follow, surprisingly, from the construction of a very natural shellable simplicial complex whose facets are in bijection with irreducible numerical semigroups of a fixed Frobenius number and whose $h$-vector determines the probability that a particular element lies in the semigroup.
Well ordered covers of square-free monomial ideals are subsets of the minimal generating set ordered in a certain way that give rise to a Lyubeznik resolution for the ideal, and have guaranteed nonvanishing Betti numbers in certain degrees. This paper is about square-free monomial ideals which have a well ordered cover. We consider the question of subadditivity of syzygies of square-free monomial ideals via complements in the lcm lattice of the ideal, and examine how lattice complementation breaks well ordered covers of the ideal into (well ordered) covers of subideals. We also introduce a fam…
We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear resolution, as do all of its powers, if and only if the colouring satisfies a certain nesting property. In the case when the colouring is nested, we give a minimal cellular resolution supported on a cubical complex. From this, we give the graded Betti numbers in terms of the face-vector of the underlying simplicial complex. Moreover, we explicitly describe the…
Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the clique complex of the $m$-clutter corresponding to the set $\mathcal{S}$. As a consequence one obtains explicit formulas for the graded Betti numbers $β_{i,i+m}(J)$ for all $i\geq 0$. We also determine all sets $\mathcal{S}$ for which $J$ has a linear resolution.
To a matroid M with n edges, we associate the so-called facet ideal F(M) generated by monomials corresponding to bases of M. We show that the Betti numbers related to an N-graded minimal free resolution of F(M) are determined by the Betti numbers related to the blocks of M. Similarly, we show that the higher weight hierarchy of M is determined by the weight hierarchies of the blocks, as well. Drawing on these results, we show that when M is the cycle matroid of a cactus graph, the Betti numbers determine the higher weight hierarchy -- and vice versa. Finally, we demonstrate by way of counterex…
We show that for proving the Stanley conjecture, it is sufficient to consider a very special class of monomial ideals. These ideals (or rather their lcm lattices) are in bijection with the simplicial spanning trees of skeletons of a simplex. We apply this result to verify the Stanley conjecture for quotients of monomial ideals with up to six generators. For seven generators we obtain a partial result.
Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when these pure simplicial complexes are vertex decomposable or not Cohen-Macaulay. As a corollary, we classify the van der Waerden complexes that are shellable.
In this paper we describe the irreducible decomposition of the facet ideal $\F(Δ_{m,n})$ of the chessboard complex $Δ_{m,n}$ with $n\geq m$. We also provide some lower bounds for depth and regularity of the facet ideal $\F(Δ_{m,n})$. When $m\leq 3$, we prove that these lower bounds can be obtained.
Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear resolution appears as the Betti sequence of the circuit ideal of such a chordal clutter. Associated with any simplicial order is a sequence of integers which we call the $λ$-sequence of the chordal clutter. All possible $λ$-sequences are characterized. They are intimately related to the Hilbert function of a suitable standard graded $K$-algebra attached to the ch…
In this paper, the relation between algebraic shifting and join which was conjectured by Eran Nevo will be proved. Let $σ$ and $τ$ be simplicial complexes and $σ* τ$ their join. Let $J_σ$ be the exterior face ideal of $σ$ and $Δ(σ)$ the exterior algebraic shifted complex of $σ$. Assume that $σ* τ$ is a simplicial complex on $[n]=\{1,2,...,n\}$. For any $d$-subset $S \subset [n]$, let $m_{\preceq_{rev} S}(σ)$ denote the number of $d$-subsets $R \in σ$ which is equal to or smaller than $S$ w.r.t. the reverse lexicographic order. We will prove that $m_{\preceq_{rev} S}(Δ({σ* τ}))\geq m_{\preceq_{…
Bounds for the maximal degree of certain Gröbner bases of simplicial toric ideals are given. These bounds are close to the bound stated in Eisenbud-Goto's Conjecture on the Castelnuovo-Mumford regularity.
We study the minimal primary decomposition of completely $t$-spread lexsegment ideals via simplicial complexes. We determine some algebraic invariants of such a class of $t$-spread ideals. Hence, we classify all $t$-spread lexsegment ideals which are Cohen-Macaulay.
When a cone is added to a simplicial complex $Δ$ over one of its faces, we investigate the relation between the arithmetical ranks of the Stanley-Reisner ideals of the original simplicial complex and the new simplicial complex $Δ'$. In particular, we show that the arithmetical rank of the Stanley-Reisner ideal of $Δ'$ equals the projective dimension of the Stanley-Reisner ring of $Δ'$ if the corresponding equality holds for $Δ$.
We extend a result of Minh and Trung to get criteria for $\depth I=\depth\sqrt{I}$ where $I$ is an unmixed monomial ideal of the polynomial ring $S=K[x_1,..., x_n]$. As an application we characterize all the pure simplicial complexes $Δ$ which have rigid depth, that is, which satisfy the condition that for every unmixed monomial ideal $I\subset S$ with $\sqrt{I}=I_Δ$ one has $\depth(I)=\depth(I_Δ).$
Given a simplicial complex we associate to it a squarefree monomial ideal which we call the face ideal of the simplicial complex, and show that it has linear quotients. It turns out that its Alexander dual is a whisker complex. We apply this construction in particular to chain and antichain ideals of a finite partially ordered set. We also introduce so-called higher dimensional whisker complexes and show that their independence complexes are shellable.
We prove the subadditivity property for the maximal degrees of the syzygies of facet ideals simplicial forests. For such an ideal $I$, if the $i$-th Betti number is nonzero and $i=a+b$, we show that there are monomials in the lcm lattice of $I$ that are complements in part of the lattice, each supporting a nonvanishing $a$-th and $b$-th Betti numbers. The subadditivity formula follows from this observation.
In attempting to understand how combinatorial modifications alter algebraic properties of monomial ideals, several authors have investigated the process of adding "whiskers" to graphs. In this paper, we study a similar construction to build a simplicial complex $Δ_χ$ from a coloring $χ$ of a subset of the vertices of $Δ$, and give necessary and sufficient conditions for this construction to produce vertex decomposable simplicial complexes. We apply this work to strengthen and give new proofs about sequentially Cohen-Macaulay edge ideals of graphs.
Given a simplicial complex, it is easy to construct a generic deformation of its Stanley-Reisner ideal. The main question under investigation in this paper is how to characterize the simplicial complexes such that their Stanley-Reisner ideals have Cohen-Macaulay generic deformations. Algorithms are presented to construct such deformations for matroid complexes, shifted complexes, and tree complexes.
Bounds for the maximum degree of a minimal Gröbner basis of simplicial toric ideals with respect to the reverse lexicographic order are given. These bounds are close to the bound stated in Eisenbud-Goto's Conjecture on the Castelnuovo-Mumford regularity.
We characterize when the monomial maximal ideal of a simplicial affine semigroup ring has a monomial minimal reduction. When this is the case, we study the Cohen-Macaulay and Gorenstein properties of the associated graded ring and provide several bounds for the reduction number with respect to the monomial minimal reduction.
Given a square-free monomial ideal $I$, we define a simplicial complex labeled by the generators of $I^2$ which supports a free resolution of $I^2$. As a consequence, we obtain (sharp) upper bounds on the Betti numbers of the second power of any square-free monomial ideal.
Let $Δ$ be a one-dimensional simplicial complex. Let $I_Δ$ be the Stanley-Reisner ideal of $Δ$. We prove that for all $s \ge 1$ and all intermediate ideals $J$ generated by $I_Δ^s$ and some minimal generators of $I_Δ^{(s)}$, we have $${\rm reg} J = {\rm reg} I_Δ^s = {\rm reg} I_Δ^{(s)}.$$
A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial complexes, in particular for stacked polytopes.
We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set for an arbitrary ideal $I$. In particular, we compute the Betti table for removing an arbitrary generator from the ideal of submaximal pfaffians of a generic skew symmetric matrix $M$. We also explicitly compute the Betti table for the ideal generated by certain subsets of the generating set of the ideal of maximal minors of a generic $n \times m$ matrix. S…
One of the main open questions in liaison theory is whether every homogeneous Cohen-Macaulay ideal in a polynomial ring is glicci, i.e. if it is in the G-liaison class of a complete intersection. We give an affirmative answer to this question for Stanley-Reisner ideals defined by simplicial complexes that are weakly vertex-decomposable. This class of complexes includes matroid, shifted and Gorenstein complexes respectively. Moreover, we construct a simplicial complex which shows that the property of being glicci depends on the characteristic of the base field. As an application of our methods …
In this article, we define a class of binomial ideals associated to a simplicial complex. This class of ideals appears in the presentation of fiber cones of codimension 2 lattice ideals \cite{hm}, and in the work of Barile and Morales \cite{bm2}, \cite{bm3}, \cite{bm4}. We compute the reduction number of Binomial extensions of Simplicial ideals. This extends all the previous results in this area.
