Let F be a field and let G be a finite graph with a total ordering on its edge set. Richard Stanley noted that the Stanley-Reisner ring F(G) of the broken circuit complex of G is Cohen-Macaulay. Jason Brown gave an explicit description of a homogeneous system of parameters for F(G) in terms of fundamental cocircuits in G. So F(G) modulo this hsop is a finite dimensional vector space. We conjecture an explicit monomial basis for this vector space in terms of the circuits of G and prove that the conjecture is true for two infinite families of graphs. We also explore an application of these ideas to bounding the number of acyclic orientations of G from above.
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.
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.
We will study monomial ideals $I$ in the exterior algebra as well as in the polynomial ring whose generic initial ideal is constant for all term orders up to permutations of variables. First, in the exterior algebra, we determine all graphs and all flag complexes whose exterior face ideal satisfies the above condition. Second, in the polynomial ring, it will be shown that the generic initial ideal $\gin_σ(I(G))$ of the edge ideal $I(G)$ of a graph $G$ is constant for all term orders $σ$ up to permutations of variables if and only if $G$ is a complete bipartite graph.
For a simplicial complex X and a field K, let h_i(X)=\dim \tilde{H}_i(X;K). It is shown that if X,Y are complexes on the same vertex set, then for all k h_{k-1}(X\cap Y) \leq \sum_{σ\in Y} \sum_{i+j=k} h_{i-1}(X[σ])\cdot h_{j-1}(\lk(Y,σ)) . A simplicial complex X is d-Leray over K, if h_i(Y)=0 for all induced subcomplexes Y \subset X and i \geq d. Let L_K(X) denote the minimal d such that X is d-Leray over K. The above theorem implies that if X,Y are simplicial complexes on the same vertex set then L_K(X \cap Y) \leq L_K(X) +L_K(Y). Reformulating this inequality in commutative algebra terms, w…
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.
Alexander duality has, in the past, made its way into commutative algebra through Stanley-Reisner rings of simplicial complexes. This has the disadvantage that one is limited to squarefree monomial ideals. The notion of Alexander duality is generalized here to arbitrary monomial ideals. It is shown how this duality is naturally expressed by Bass numbers, in their relations to the Betti numbers of a monomial ideal and its Alexander dual. Relative cohomological constructions on cellular complexes are shown to relate cellular free resolutions of a monomial ideal to free resolutions of its Alexand…
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_Δ).$
There are many connections between the invariants of the different powers of an ideal. We investigate how to construct minimal resolutions for all powers at once using methods from algebraic and polyhedral topology with a focus on ideals arising from combinatorics. In one construction, we obtain cellular resolutions for all powers of edge ideals of bipartite graphs on n vertices, supported by (n-2)-dimensional complexes. Our main result is an explicit minimal cellular resolution for all powers of edge ideals of paths. These cell complexes are constructed by first subdividing polyhedral complex…
In this paper, we study ideals $I$ whose linear strand can be supported on a regular CW complex. We provide a sufficient condition for the linear strand of an arbitrary subideal of $I$ to remain supported on an easily described subcomplex. In particular, we prove that a certain class of rainbow monomial ideals always have linear strand supported on a regular CW complex, including any initial ideal of the ideal of maximal minors of a generic matrix. We also provide a sufficient condition for these ideals to have linear resolution, which is also an equivalence under mild assumptions. We then emp…
We study Stanley-Reisner ideals of broken circuits complexes and characterize those ones admitting a linear resolution or being complete intersections. These results will then be used to characterize arrangements whose Orlik-Terao ideal has the same properties. As an application, we improve a result of Wilf on upper bounds for the coefficients of the chromatic polynomial of a maximal planar graph. We also show that for an ordered matroid with disjoint minimal broken circuits, the supersolvability of the matroid is equivalent to the Koszulness of its Orlik-Solomon algebra.
In this paper, we introduce the concept of $k$-clean monomial ideals as an extension of clean monomial ideals and present some homological and combinatorial properties of them. Using the hierarchal structure of $k$-clean ideals, we show that a $(d-1)$-dimensional simplicial complex is $k$-decomposable if and only if its Stanley-Reisner ideal is $k$-clean, where $k\leq d-1$. We prove that the classes of monomial ideals like monomial complete intersection ideals, Cohen-Macaulay monomial ideals of codimension 2 and symbolic powers of Stanley-Reisner ideals of matroid complexes are $k$-clean for a…
It is proved that the broken circuit complex of an ordered matroid is Gorenstein if and only if it is a complete intersection. Several characterizations for a matroid that admits such an order are then given, with particular interest in the $h$-vector of broken circuit complexes of the matroid. As an application, we prove that the Orlik--Terao algebra of a hyperplane arrangement is Gorenstein if and only if it is a complete intersection. Interestingly, our result shows that the complete intersection property (and hence the Gorensteinness as well) of the Orlik--Terao algebra can be determined f…
We investigate monomial labellings on cell complexes, giving a minimal cellular resolution of the ideal generated by these monomials, and such that the associated quotient ring is Cohen-Macaulay. We introduce a notion of such a labelling being maximal. There is only a finite number of maximal labellings for each cell complex, and we classify these for trees, partly for subdivisions of polygons, and for some classes of selfdual polytopes.
Associated to every finite simplicial complex K there is a "moment-angle" finite CW-complex, Z_K; if K is a triangulation of a sphere, Z_K is a smooth, compact manifold. Building on work of Buchstaber, Panov, and Baskakov, we study the cohomology ring, the homotopy groups, and the triple Massey products of a moment-angle complex, relating these topological invariants to the algebraic combinatorics of the underlying simplicial complex. Applications to the study of non-formal manifolds and subspace arrangements are given.
The machinery of zonotopal algebra is linked with two particular polytopes: the Stanley-Pitman polytope and the regular simplex $\mathfrak{Sim}_n(t_1,...,t_n)$ with parameters $t_1,...,t_n\in \mathbb{R}_+^n$, defined by the inequalities $\sum_{i=1}^n r_i\leq \sum_{i=1}^n t_i, \mbox{ } r_i\in \mathbb{R}_+^n,$ where the $(r_i)_{i\in [n]}$ are variables. Specifically, we will discuss the central Dahmen-Micchelli space of the broken wheel graph $BW_n$ and its dual, the $\mathcal{P}$-central space. We will observe that the $\mathcal{P}$-central space of $BW_n$ is monomial, with a basis given by the…
We prove that the Stanley--Reisner ideal of the Alexander dual of the subword complexes in Coxeter groups has linear quotients with respect to the lexicographical order of the minimal monomial generators. As a consequence, we obtain a shelling order on the facets of the subword complex. We relate some invariants of the subword complexes or of their dual with invariants of the word. For a particular class of subword complexes, we prove that the Stanley--Reisner ring is a complete intersection ring.
One of the major open questions in matroid theory asks whether the $h$-vector $(h_0,h_1,\ldots,h_s)$ of the broken circuit complex of a matroid $M$ satisfies the following inequalities: $$ h_0\leq h_1\leq \cdots\leq h_{\lfloor s/2\rfloor} \quad \text{and}\qua h_i\le h_{s-i}\ \text{ for }\ 0\leq i \leq \lfloor s/2\rfloor. $$ This paper affirmatively answers the question for matroids that are representable over a field of characteristic zero.
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.
Brown has shown that the Stanley-Reisner ring of the broken circuit complex of a graph has a linear system of parameters which is defined in terms of the circuits and cocircuits of the graph. Later on Brown and Sagan conjectured a special set of monomials - a so-called NBC basis - described in terms of the circuits and cocircuits of the graph to be a monomial basis for the corresponding quotient of the Stanley-Reisner ring and proved this to be true for theta and phi graphs. We generalize the aforementioned linear system of parameters to broken circuit complexes of regular matroids and transfe…
We study the dependence of graded Betti numbers of monomial ideals on the characteristic of the base field. The examples we describe include bipartite ideals, Stanley--Reisner ideals of vertex-decomposable complexes and ideals with componentwise linear resolutions. We give a description of bipartite graphs and, using discrete Morse theory, provide a way of looking at the homology of arbitrary simplicial complexes through bipartite ideals. We also prove that the Betti table of a monomial ideal over the field of rational numbers can be obtained from the Betti table over any field by a sequence o…
We present a number of lower bounds for the h-vectors of k-CM, broken circuit and independence complexes. These lead to bounds on the coefficients of the characteristic and reliability polynomials of matroids. The main techniques are the use of series and parallel constructions on matroids and the short simplicial h-vector for pure complexes.
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional generalizations of combined spanning trees for cycles and cocycles ("hedges") in the upper Koszul simplicial complexes of $I$ at lattice points in $\mathbb{Z}^n$. The differentials in these "sylvan resolutions" are expressed as matrices whose entries are sums over lattice paths of weights determined combinatorially by sequences of hedges ("hedgerows") along each lattice…
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.
Inspired by the study of random graphs and simplicial complexes, and motivated by the need to understand average behavior of ideals, we propose and study probabilistic models of random monomial ideals. We prove theorems about the probability distributions, expectations and thresholds for events involving monomial ideals with given Hilbert function, Krull dimension, first graded Betti numbers, and present several experimentally-backed conjectures about regularity, projective dimension, strong genericity, and Cohen-Macaulayness of random monomial ideals.
We show that monomial ideals generated in degree two satisfy a conjecture by Eisenbud, Green and Harris. In particular we give a partial answer to a conjecture of Kalai by proving that $h$-vectors of flag Cohen-Macaulay simplicial complexes are $h$-vectors of Cohen-Macaulay balanced simplicial complexes.
Hilbert functions over the exterior algebra and f-vectors in higher rank I: Amata-Crupi monomial modules, Kozlov polytopes, and r-vectors of simplicial complexes
Monomial ideals which are generic with respect to either their generators or irreducible components have minimal free resolutions derived from simplicial complexes. For a generic monomial ideal, the associated primes satisfy a saturated chain condition, and the Cohen-Macaulay property implies shellability for both the Scarf complex and the Stanley-Reisner complex. Reverse lexicographic initial ideals of generic lattice ideals are generic. Cohen-Macaulayness for cogeneric ideals is characterized combinatorially; in the cogeneric case the Cohen-Macaulay type is greater than or equal to the numbe…
We introduce notions of vector field and its (discrete time) flow on a chain complex. The resulting dynamical systems theory provides a set of tools with a broad range of applicability that allow, among others, to replace in a canonical way a chain complex with a "smaller" one of the same homotopy type. As applications we construct in an explicit, canonical, and symmetry-preserving fashion a minimal free resolution for every toric ring and every monomial ideal. Our constructions work in all characteristics and over any base field. A key subtle new point is that in certain finitely many positiv…
Let $(h_0,h_1,\ldots,h_s)$ with $h_s\ne0$ be the $h$-vector of the broken circuit complex of a series-parallel network $M$. Let $G$ be a graph whose cycle matroid is $M$. We give a formula for the difference $h_{s-1}-h_1$ in terms of an ear decomposition of $G$. A number of applications of this formula are provided, including several bounds for $h_{s-1}-h_1$, a characterization of outerplanar graphs, and a solution to a conjecture on $A$-graphs posed by Fenton. We also prove that $h_{s-2}\geq h_2$ when $s\geq 4$.
On the closed neighborhood ideal of the square of broom and double broom graphs
Faculty of Marine Engineering, Romanian Naval Academy “Mircea cel Bătrân”（罗马尼亚海军学院“米尔恰·切·巴特兰”海事工程学院）；Faculty of Applied Sciences, National University of Science and Technology Politehnica Bucharest（布加勒斯特理工大学国家科学与技术大学应用科学学院）
Given an ascending chain $(I_n)_{n\in\mathbb{N}}$ of $\Sym$-invariant squarefree monomial ideals, we study the corresponding chain of Alexander duals $(I_n^\vee)_{n\in\mathbb{N}}$. Using a novel combinatorial tool, which we call \emph{avoidance up to symmetry}, we provide an explicit description of the minimal generating set up to symmetry in terms of the original generators. Combining this result with methods from discrete geometry, this enables us to show that the number of orbit generators of $I_n^\vee$ is given by a polynomial in $n$ for sufficiently large $n$. The same is true for the num…
We prove a duality theorem for simplicial complexes arising from a combinatorial construction we define, which applies to the squarefree monomial complexes for Veronese ideals of projective spaces and weighted projective spaces. Our theorem yields a formula for the multigraded Betti numbers of these Veronese ideals in terms of the reduced homology groups of these complexes which is dual to one given by Bruns and Herzog. We apply this formula in several ways, including by giving an algorithm for finding the highest syzygy of such a Veronese ideal.
A square-free monomial ideal $I$ of $k[x_1,\ldots,x_n]$ is said to be an $f$-ideal if the facet complex and non-face complex associated with $I$ have the same $f$-vector. We show that $I$ is an $f$-ideal if and only if its Newton complementary dual $\widehat{I}$ is also an $f$-ideal. Because of this duality, previous results about some classes of $f$-ideals can be extended to a much larger class of $f$-ideals. An interesting by-product of our work is an alternative formulation of the Kruskal-Katona theorem for $f$-vectors of simplicial complexes.
Let G be a graph with vertex set {1,...,n}. A spanning forest F of G is increasing if the sequence of labels on any path starting at the minimum vertex of a tree of F form an increasing sequence. Hallam and Sagan showed that the generating function ISF(G,t) for increasing spanning forests of G has all nonpositive integral roots. Furthermore they proved that, up to a change of sign, this polynomial equals the chromatic polynomial of G precisely when 1,...,n is a perfect elimination order for G. We give new, purely combinatorial proofs of these results which permit us to generalize them in sever…
An order ideal is a finite poset X of (monic) monomials such that, whenever M is in X and N divides M, then N is in X. If all, say t, maximal monomials of X have the same degree, then X is pure (of type t). A pure O-sequence is the vector, h=(1,h_1,...,h_e), counting the monomials of X in each degree. Equivalently, in the language of commutative algebra, pure O-sequences are the h-vectors of monomial Artinian level algebras. Pure O-sequences had their origin in one of Richard Stanley's early works in this area, and have since played a significant role in at least three disciplines: the study o…
We generalize the definition and enumeration of spanning trees from the setting of graphs to that of arbitrary-dimensional simplicial complexes $Δ$, extending an idea due to G. Kalai. We prove a simplicial version of the Matrix-Tree Theorem that counts simplicial spanning trees, weighted by the squares of the orders of their top-dimensional integral homology groups, in terms of the Laplacian matrix of $Δ$. As in the graphic case, one can obtain a more finely weighted generating function for simplicial spanning trees by assigning an indeterminate to each vertex of $Δ$ and replacing the entries …
We study Stanley's long-standing conjecture that the h-vectors of matroid simplicial complexes are pure O-sequences. Our method consists of a new and more abstract approach, which shifts the focus from working on constructing suitable artinian level monomial ideals, as often done in the past, to the study of properties of pure O-sequences. We propose a conjecture on pure O-sequences and settle it in small socle degrees. This allows us to prove Stanley's conjecture for all matroids of rank 3. At the end of the paper, using our method, we discuss a first possible approach to Stanley's conjecture…
Let M be a matroid on E, representable over a field of characteristic zero. We show that h-vectors of the following simplicial complexes are log-concave: 1. The matroid complex of independent subsets of E. 2. The broken circuit complex of $M$ relative to an ordering of E. The first implies a conjecture of Colbourn on the reliability polynomial of a graph, and the second implies a conjecture of Hoggar on the chromatic polynomial of a graph. The proof is based on the geometric formula for the characteristic polynomial of Denham, Garrousian, and Schulze.
