Simplicial complexes and minimal free resolution of monomial algebras
Ignacio Ojeda, A. Vigneron-Tenorio
备注：
20 pages, this work was presented as a poster at the 'International Conference on Commutative, Combinatorial and Computational Algebra in Honour of Pilar Pison Casares' Seville, February 11 - 16, 2008. http://departamento.us.es/da/actividades/ciaccc.htm
This paper is concerned with the combinatorial description of the graded minimal free resolution of certain monomial algebras which includes toric rings. Concretely, we explicitly describe how the graded minimal free resolution of those algebras is related to the combinatorics of some simplicial complexes. Our description may be interpreted as an algorithmic procedure to partially compute this resolution.
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.
We will give a pure combinatorial proof of the Eisenbud-Goto conjecture for arbitrary monomial curves. Moreover, we will show that the conjecture holds for certain simplicial affine semigroup rings.
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.
In this paper, we study simplicial complexes whose Stanley-Reisner rings are almost Gorenstein and have $a$-invariant zero. We call such a simplicial complex an almost Gorenstein* simplicial complex. To study the almost Gorenstein* property, we introduce a new class of simplicial complexes which we call uniformly Cohen-Macaulay simplicial complexes. A $d$-dimensional simplicial complex $Δ$ is said to be uniformly Cohen-Macaulay if it is Cohen-Macaulay and, for any facet $F$ of $Δ$, the simplicial complex $Δ\setminus\{F\}$ is Cohen-Macaulay of dimension $d$. We investigate fundamental algebraic…
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 call a simplicial complex algebraically rigid if its Stanley-Reisner ring admits no nontrivial infinitesimal deformations, and call it inseparable if does not allow any deformation to other simplicial complexes. Algebraically rigid simplicial complexes are inseparable. In this paper we study inseparability and rigidity of Stanley-Reisner rings, and apply the general theory to letterplace ideals as well as to edge ideals of graphs. Classes of algebraically rigid simplicial complexes and graphs are identified.
Let $Δ$ be a stable simplicial complex on $n$ vertexes. Over an arbitrary base field $K$, the symmetric algebraic shifted complex $Δ^s$ of $Δ$ is defined. It is proved that the Betti numbers of the Stanley-Reisner ideals in the polynomial ring $K[x_1,x_2,...,x_n]$ of the symmetric algebraic shifted, exterior algebraic shifted and combinatorial shifted complexes of $Δ$ are equal.
We show that a Buchsbaum simplicial complex of small codimension must have large depth. More generally, we achieve a similar result for ${\rm CM}_t$ simplicial complexes, a notion generalizing Buchsbaum-ness, and we prove more precise results in the codimension 2 case. Along the paper, we show that the ${\rm CM}_t$ property is a topological invariant of a simplicial complex.
We study Stanley decompositions and show that Stanley's conjecture on Stanley decompositions implies his conjecture on partitionable Cohen-Macaulay simplicial complexes. We also prove these conjectures for all Cohen-Macaulay monomial ideals of codimension 2 and all Gorenstein monomial ideals of codimension 3.
We present a short proof of Reisner's Theorem, characterizing which simplicial complexes have a Cohen-Macaulay face ring. In some cases, we can also express some homological invariants of the face ring in terms of the reduced homology of the complex.
We prove a reformulation of the multiplicity upper bound conjecture and use that reformulation to prove it for three-dimensional simplicial complexes and homology manifolds with many vertices. We provide necessary conditions for a Cohen-Macaulay complex with many vertices to have a pure minimal free resolution and a characterization of flag complexes whose minimal free resolution is pure.
In this paper we study the quasi-forest simplicial complexes and we define the concept of simplicial $k$-cycle (denoted by $\mathcal{S}_k$) and simplicial $k$-point (denoted by $\mathcal{P}_k$). We show that a simplicial complex $Δ$ is quasi-forest if and only if it does not have any $\mathcal{P}_k$ and any $\mathcal{S}_k$ for $k\geq 3$. Furthermore we characterize almost Cohen-Macaulay quasi-forest simplicial complexes. In the end we show that the cycle graph $G=C_n$ is almost Cohen-Macaulay if and only if $n=3,4,5,6,7,8,9,11$.
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.
In this paper we show that expansion of a Buchsbaum simplicial complex is $CM_t$, for an optimal integer $t\geq 1$. Also, by imposing extra assumptions on a $CM_t$ simplicial complex, we prove that it can be obtained from a Buchsbaum complex.
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 use the natural homeomorphism between a regular CW-complex X and its face poset P_X to establish a canonical isomorphism between the cellular chain complex of X and the result of applying the poset construction of arXiv:0806.4532v1 to P_X. For a monomial ideal whose free resolution is supported on a regular CW-complex, this isomorphism allows the free resolution of the ideal to be realized as a CW-poset resolution. Conversely, any CW-poset resolution of a monomial ideal gives rise to a resolution supported on a regular CW-complex.
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 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.
Let $\D$ be a $(d-1)$-dimensional pure $f$-simplicial complex over vertex set $[n]$. In this paper, it is proved that $n=2d$ holds true if $\D$ is minimal Cohen-Macaulay. It is also indicated that the recent work of \cite{Dao2020} implies that shellable condition on a pure simplicial complex $\D$ is identical with CM properties of a full series of subcomplexes of $\D$.
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…
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.
Let $G$ be a finite simple graph. The line graph $L(G)$ represents the adjacencies between edges of $G$. We define first the line simplicial complex $Δ_L(G)$ of $G$ containing Gallai and anti-Gallai simplicial complexes $Δ_Γ(G)$ and $Δ_{Γ'}(G)$ (respectively) as spanning subcomplexes. The study of connectedness of simplicial complexes is interesting due to various combinatorial and topological aspects. In Theorem 3.3, we prove that the line simplicial complex $Δ_L(G)$ is connected if and only if $G$ is connected. In Theorem 3.4, we establish the relation between Euler characteristics of line a…
We introduce the notion of k-hyperclique complexes, i.e., the largest simplicial complexes on the set [n] with a fixed k-skeleton. These simplicial complexes are a higher-dimensional analogue of clique (or flag) complexes (case k=2) and they are a rich new class of simplicial complexes. We show that Dirac's theorem on chordal graphs has a higher-dimensional analogue in which graphs and clique complexes get replaced, respectively, by simplicial matroids and k-hyperclique complexes. We prove also a higher-dimensional analogue of Stanley's reformulation of Dirac's theorem on chordal graphs.
In this paper we extend one direction of Fröberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the introduction of d-chorded and orientably-d-cycle-complete simplicial complexes. We show that a certain class of simplicial complexes, the d-dimensional trees, correspond to ideals having linear resolutions over fields of characteristic 2 and also give a necessary combinatorial condition for a monomial ideal to be componentwise linear over all fields.
We examine virtual resolutions of Stanley-Reisner ideals for a product of projective spaces. In particular, we provide sufficient conditions for a simplicial complex to be virtually Cohen-Macaulay (to have a virtual resolution with length equal to its codimension). We also show that all balanced simplicial complexes are virtually Cohen-Macaulay.
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 …
Weighted simplicial complexes (WSCs) are powerful tools for describing weighted cloud data or networks with weighted nodes. In this paper, we propose a novel approach to study WSCs via the concept of polarization. Polarization of a WSC allows one to construct a new (unweighted) simplicial complex which coincides with an object called the mixed wreath product. This new construction preserves several properties and invariants of the underlying simplicial complex of a WSC. Our main focus is to analyze WSCs through their underlying simplicial complexes and mixed wreath products. Combinatorially, w…
We define and study the notion of a minimal Cohen-Macaulay simplicial complex. We prove that any Cohen-Macaulay complex is shelled over a minimal one in our sense, and we give sufficient conditions for a complex to be minimal Cohen-Macaulay. We show that many interesting examples of Cohen-Macaulay complexes in combinatorics are minimal, including Rudin's ball, Ziegler's ball, the dunce hat, and recently discovered non-partitionable Cohen-Macaulay complexes. We further provide various ways to construct such complexes.
We prove some new rank selection theorems for balanced simplicial complexes. Specifically, we prove that rank selected subcomplexes of balanced simplicial complexes satisfying Serre's condition $(S_{\ell})$ retain $(S_{\ell})$. We also provide a formula for the depth of a balanced simplicial complex in terms of reduced homologies of its rank selected subcomplexes. By passing to a barycentric subdivision, our results give information about Serre's condition and the depth of any simplicial compex. Our results extend rank selection theorems for depth proved by Stanley, Munkres, and Hibi.
For a simplicial complex X on {1,2, ..., n} we define enriched homology and cohomology modules. They are graded modules over k[x_1, ..., x_n] whose ranks are equal to the dimensions of the reduced homology and cohomology groups. We characterize Cohen-Macaulay, l-Cohen-Macaulay, Buchsbaum, and Gorenstein* complexes X, and also orientable manifolds in terms of the enriched modules. We introduce the notion of girth for simplicial complexes and make a conjecture relating the girth to invariants of the simplicial complex. We also put strong vanishing conditions on the enriched homology modules and …
A relative simplicial complex is a collection of sets of the form $Δ\setminus Γ$, where $Γ\subset Δ$ are simplicial complexes. Relative complexes played key roles in recent advances in algebraic, geometric, and topological combinatorics but, in contrast to simplicial complexes, little is known about their general combinatorial structure. In this paper, we address a basic question in this direction and give a characterization of $f$-vectors of relative (multi)complexes on a ground set of fixed size. On the algebraic side, this yields a characterization of Hilbert functions of quotients of homog…
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.
In this paper, we give a new algebraic criterion for the {\em shellability} of (non-pure) simplicial complex $Δ$ over $[n]$, shellable in the sense of Björner and Wachs \cite{BW}. We show that the spanning simplicial complex of doubly uni-cyclic graph is non-pure shellable. Moreover, we introduce the concept of Gallai-simplicial complex $Δ_Γ(G)$ of a finite simple graph $G$. We applied the obtained criterion to discuss the shellability of Gallai simplicial complexes associated to various classes of graphs..
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_Δ).$
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.
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.
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.
We study monomial ideals using the operation polarization to first turn them into square-free monomial ideals. We focus on monomial ideals whose polarization produce simplicial trees, and show that many of the properties of simplicial trees hold for such ideals.This includes Cohen-Macaulayness of the Rees ring, and being sequentially Cohen-Macaulay. The appendix is an independent study of primary decomposition in a sequentially Cohen-Macaulay module. We demonstrate how every submodule appearing in the filtration of a sequentially Cohen-Macaulay module can be described in terms of the primary d…
Golodness of 2-dimensional simplicial complexes is studied through polyhedral products, and combinatorial and topoogical characterization of Golodness of surface triangulations is given. An answer to the question of Berglund is also given so that there is a 2-dimensional simplicial complex which is rationally Golod but is not Golod over $\mathbb{Z}/p$.
Buchstaber invariant is a numerical characteristic of a simplicial complex, arising from torus actions on moment-angle complexes. In the paper we study the relation between Buchstaber invariants and classical invariants of simplicial complexes such as bigraded Betti numbers and chromatic invariants. The following two statements are proved. (1) There exists a simplicial complex U with different real and ordinary Buchstaber invariants. (2) There exist two simplicial complexes with equal bigraded Betti numbers and chromatic numbers, but different Buchstaber invariants. To prove the first theorem …
