The paper that was here is a preprint that was never turned into a proper paper. In particular it does not have enough citations to the literature. The paper "The Slice Algorithm For Irreducible Decomposition of Monomial Ideals" contains a much better description of the Label algorithm than this preprint did. If you still wish to read the original preprint then access the arXiv's version 1 of this paper, instead of version 2 which is what you are reading now.
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible decompositions, Alexander duals and socles of monomial ideals. The paper includes experiments showing good performance in practice.
Aim of this paper is to count $0$-dimensional stable and strongly stable ideals in $2$ and $3$ variables, given their (constant) affine Hilbert polynomial. To do so, we define the Bar Code, a bidimensional structure representing any finite set of terms $M$ and allowing to desume many properties of the corresponding monomial ideal $I$, if $M$ is an order ideal. Then, we use it to give a connection between (strongly) stable monomial ideals and integer partitions, thus allowing to count them via known determinantal formulas.
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals. We also study the Stanley depth of the monomial ideal associated of the independent sets of a graph.
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree monomial ideals where it is equivalent to a well-known characterization of matroids. We prove our conjecture in many other special cases. We also introduce the concept of componentwise polymatroidal ideals and extend several of the results, known for polymatroidal ideals, to this new class of ideals.
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…
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…
Squarefree monomial ideals arising from finite meet-semilattices and their free resolutions are studied. For the squarefree monomial ideals corresponding to poset ideals in a distributive lattice the Alexander dual is computed.
We study blowups of affine n-space with center an arbitrary monomial ideal and call monomial ideals that render smooth blowups tame ideals. We give a combinatorial criterion to decide whether the blowup is smooth and apply this criterion to discuss a smoothing procedure proposed by Rosenberg, monomial building sets and permutohedra.
In this paper we study squarefree monomial ideals which have constant depth functions. Edge ideals, matroidal ideals and facet ideals of pure simplicial forests connected in codimension one with this property are classified.
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 Δ.
Castelnuovo-Mumford regularity is a measure of algebraic complexity of an ideal. Regularity of monomial ideals can be investigated combinatorially. We use a simple graph decomposition and results from structural graph theory to prove, improve and generalize many of the known bounds on regularity of quadratic square-free monomial ideals.
In this paper we discuss the problem of characterizing the Cohen-Macaulay property of certain families of monomial ideals with fixed radical. More precisely, we consider generically complete intersection monomial ideals whose radical corresponds to special classes of simplicial complexes.
We prove that the integral closures of the powers of a squarefree monomial ideal I equal the symbolic powers if and only if I is the edge ideal of a Fulkersonian hypergraph.
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 introduce pretty $k$-clean monomial ideals and $k$-decomposable multicomplexes, respectively, as the extensions of the notions of $k$-clean monomial ideals and $k$-decomposable simplicial complexes. We show that a multicomplex $Γ$ is $k$-decomposable if and only if its associated monomial ideal $I(Γ)$ is pretty $k$-clean. Also, we prove that an arbitrary monomial ideal $I$ is pretty $k$-clean if and only if its polarization $I^p$ is $k$-clean. Our results extend and generalize some results due to Herzog-Popescu, Soleyman Jahan and the current author.
When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable decomposable monomial ideals. In squarefree case, these ideals correspond to the vertex decomposable simplicial complexes. We study the relationships of the variable decomposable ideals with weakly polymatroidal ideals, weakly stable ideals and ideals with linear quotients. We also investigate the componentwise properties of all these ideals.
We prove a characterization of the j-multiplicity of a monomial ideal as the normalized volume of a polytopal complex. Our result is an extension of Teissier's volume-theoretic interpretation of the Hilbert-Samuel multiplicity for m-primary monomial ideals. We also give a description of the epsilon-multiplicity of a monomial ideal in terms of the volume of a region.
B. Sturmfels and S. Sullivant associated to any graph a toric ideal, called the cut ideal. We consider monomial cut ideals and we show that their algebraic properties such as the minimal primary decomposition, the property of having a linear resolution or being Cohen--Macaulay may be derived from the combinatorial structure of the graph.
Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{m}= (x_1, \ldots, x_n)$ be the irredundant maximal ideal of $S$. For an ideal $I \subset S$, let $\mathrm{sat}(I)$ be the minimum number $k$ for which $I \colon \mathfrak{m}^k = I \colon \mathfrak{m}^{k+1}$. In this paper, we compute the saturation number of irreducible monomial ideals and their powers. We apply this result to find the saturation number of the ordinary powers and symbolic powers of some families of monomial ideals in terms of the saturation number of irreducible components appea…
A Gotzmann monomial ideal of the polynomial ring is a monomial ideal which is generated in one degree and which satisfies Gotzmann's persistence theorem. A subset $V$ is said to be a Gotzmann subset if the ideal generated by $V$ is a Gotzmann monomial ideal. In the present paper, we find all integers $a>0$ such that every Gotzmann subset $V$ with $|V|=a$ is lexsegment (up to the permutation of the variables). In addition, we classify all Gotzmann subsets of $K[x_1,x_2,x_3]$.
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple combinatorial properties of its labeled hypergraph. We also give specific formulas for the regularity of square-free monomial ideals with certain labeled hypergraphs. Furthermore, we prove results in the case of one-dimensional labeled hypergraphs.
The question we address in this paper is: which monomial ideals have minimal cellular resolutions, that is, minimal resolutions obtained from homogenizing the chain maps of CW-complexes? Velasco gave families of examples of monomial ideals that do not have minimal cellular resolutions, but those examples have large minimal generating sets. In this paper, we show that if a monomial ideal has at most four generators, then the ideal and its (monomial) Artinian reductions have minimal cellular resolutions. When the ideal is generated by two monomials, we can give a precise description of the CW-co…
We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.
Let $I$ be an ideal of a polynomial algebra $S$ over a field generated by square free monomials of degree $\geq d$. If $I$ contains more monomials of degree $d$ than $(n-d)/(n-d+1)$ of the total number of square free monomials of $S$ of degree $d+1$ then $\depth_SI\leq d$, in particular the Stanley's Conjecture holds in this case.
We exhibit several posets arising from commutative algebra, order theory, tropical convexity as potential face posets of tropical polyhedra, and we clarify their inclusion relations. We focus on monomial tropical polyhedra, and deduce how their geometry reflects properties of monomial ideals. Their vertex-facet lattice is homotopy equivalent to a sphere and encodes the Betti numbers of an associated monomial ideal.
We study ideal-theoretic conditions for a monomial ideal to be Golod. For ideals in a polynomial ring in three variables, our criteria give a complete characterization. Over such rings, we show that the product of two monomial ideals is Golod.
Gotzmann proved the persistence for minimal growth for ideals. His theorem is called Gotzmann's persistence theorem. In this paper, based on the combinatorics on binomial coefficients, a simple combinatorial proof of Gotzmann's persistence theorem in the special case of monomial ideals is given.
In a recent work, Fouli and Lin generalized a Villarreal's result and showed that if each connected components of the line graph of a squarefree monomial ideal contains at most a unique odd cycle, then this ideal is of linear type. In this short note, we reprove this result with Villarreal's original ideas together with a method of Conca and De Negri. We also propose a class of squarefree monomial ideals of linear type.
We investigate symbolic and regular powers of monomial ideals. For a square-free monomial ideal $I$ in $k[x_0, \ldots, x_n]$ we show $I^{t(m+e-1)-e+r)}$ is a subset of $M^{(t-1)(e-1)+r-1}(I^{(m)})^t$ for all positive integers $m$, $t$ and $r$, where $e$ is the big-height of $I$ and $M = (x_0, \ldots, x_n)$. This captures two conjectures ($r=1$ and $r=e$): one of Harbourne-Huneke and one of Bocci-Cooper-Harbourne. We also introduce the symbolic polyhedron of a monomial ideal and use this to explore symbolic powers of non-square-free monomial ideals.
Let $S = \mathbb{K}[x_1, \dots, x_n]$ be the polynomial ring over a field $\mathbb{K}$. In this paper we present a criterion for componentwise linearity of powers of monomial ideals. In particular, we prove that if a square-free monomial ideal $I$ contains no variable and some power of $I$ is componentwise linear, then $I$ satisfies gcd condition. For a square-free monomial ideal $I$ which contains no variable, we show that $S/I$ is a Golod ring provided that for some integer $s\geq 1$, the ideal $I^s$ has linear quotient with respect to a monomial order. We also provide a lower bound for some…
In this paper we give a necessary and sufficient combinatorial condition for a monomial ideal to have a linear resolution over fields of characteristic 2. We also give a new proof of Fröberg's theorem over fields of characteristic 2.
Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,...,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. For every monomial ideal $I\subset S$, We provide a recursive formula to determine a lower bound for the Stanley depth of $S/I$. We use this formula to prove the inequality ${\rm sdepth}(S/I)\geq {\rm size}(I)$ for a particular class of monomial ideals.
One of the fundamental invariants connecting algebra and geometry is the degree of an ideal. In this paper we derive the probabilistic behavior of degree with respect to the versatile Erdős-Rényi-type model for random monomial ideals defined in \cite{rmi}. We study the staircase structure associated to a monomial ideal, and show that in the random case the shape of the staircase diagram is approximately hyperbolic, and this behavior is robust across several random models. Since the discrete volume under this staircase is related to the summatory higher-order divisor function studied in number …
A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals $\hat{L}$, e.g. Cohen-Macaulayness and the dual property of having a linear resolution. Conversely, any ideal having a linear resolution is shown to be (essentially) minimal.
Let $(R,\mm)$ be a Noetherian local ring and $M$ a finitely generated $R$-module. We say $M$ has maximal depth if there is an associated prime $\pp$ of $M$ such that $\depth M=\dim R/\pp$. In this paper we study squarefree monomial ideals which have maximal depth. Edge ideals of cycle graphs, transversal polymatroidal ideals and high powers of connected bipartite graph with this property are classified.
We introduce the concept of $t$-spread monomials and $t$-spread strongly stable ideals. These concepts are a natural generalization of strongly stable and squarefree strongly stable ideals. For the study of this class of ideals we use the $t$-fold stretching operator. It is shown that $t$-spread strongly stable ideals are componentwise linear. Their height, their graded Betti numbers and their generic initial ideal are determined. We also consider the toric rings whose generators come from $t$-spread principal Borel ideals.
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bipartite graphs. Finally, we consider the frequency with which one can find particular splittings of monomial ideals and raise questions about ideals whose resolutions are characteristic-dependent.
For a graph G, we construct two algebras, whose dimensions are both equal to the number of spanning trees of G. One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to G-parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We sh…
The aim of this paper is to study the Stanley depth of symbolic powers of a squarefree monomial ideal. We prove that for every squarefree monomial ideal $I$ and every pair of integers $k, s\geq 1$, the inequalities ${\rm sdepth} (S/I^{(ks)}) \leq {\rm sdepth} (S/I^{(s)})$ and ${\rm sdepth} (I^{(ks)}) \leq {\rm sdepth} (I^{(s)})$ hold. If moreover $I$ is unmixed of height $d$, then we show that for every integer $k\geq1$, ${\rm sdepth}(I^{(k+d)})\leq {\rm sdepth}(I^{(k)})$ and ${\rm sdepth}(S/I^{(k+d)})\leq {\rm sdepth}(S/I^{(k)})$. Finally, we consider the limit behavior of the Stanley depth o…
In this paper we study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of sortability due to Sturmfels and the theory of weakly polymatroidal ideals.
Let $I \subset K[x,y]$ be a monomial ideal. How small can $μ(I^2)$ be in terms of $μ(I)$? It has been expected that the inequality $μ(I^2) > μ(I)$ should hold whenever $μ(I) \ge 2$. Here we disprove this expectation and provide a somewhat surprising answer to the above question.
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.
We show that the mixed volumes of arbitrary convex bodies are equal to mixed multiplicities of graded families of monomial ideals, and to normalized limits of mixed multiplicities of monomial ideals. This result evinces the close relation between the theories of mixed volumes from convex geometry and mixed multiplicities from commutative algebra.
We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a monomial radical if their coefficients are sufficiently general with respect to their supports. We prove this for instance in the case where some generator contains a power of a variable. Moreover, if the polynomials have only square-free terms and their coefficients do not sum to zero, then in a larger polynomial ring the ideal itself is square-free monomial. …
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 study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal invariants for the complexity of this ordered set. In particular, we give an interpretation of the height function in terms of the Hilbert-Samuel polynomial, and we compute upper and lower bounds on the maximal order type.
