We use \ZZ^d-gradings to study d-dimensional monomial ideals. The Koszul functor is employed to interpret the quasidegrees of local cohomology in terms of the geometry of distractions and to explicitly compute the multiplicities of exponents. These multigraded techniques originate from the study of hypergeometric systems of differential equations.
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 introduce the notion of Betti category for graded modules over suitably graded polynomial rings, and more generally for modules over certain small categories. Our categorical approach allows us to treat simultaneously many important cases, such as monomial ideals and toric rings. We prove that in these cases the Betti category is a finite combinatorial object that completely determines the structure of the minimal free resolution. For monomial ideals, the Betti category is the same as the Betti poset that we studied in a previous article. We describe in detail and with examples how the theo…
In this article, we give the explicit minimal free resolution of the associated graded ring of certain affine monomial curves in affine 4-space based on the standard basis theory. As a result, we give the minimal graded free resolution and compute the Hilbert function of the tangent cone of these families.
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
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. …
Continuing a well established tradition of associating convex bodies to monomial ideals, we initiate a program to construct asymptotic Newton polyhedra from decompositions of monomial ideals. This is achieved by forming a graded family of ideals based on a given decomposition. We term these graded families powers since they generalize the notions of ordinary and symbolic powers. Asymptotic invariants for these graded families are expressed as solutions to linear optimization problems on the respective convex bodies. This allows to establish a lower bound on the Waldschmidt constant of a monomi…
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…
The main result of this paper is that all antichains are finite in the poset of monomial ideals in a polynomial ring, ordered by inclusion. We present several corollaries of this result, both simpler proofs of results already in the literature and new results. One natural generalization to more abstract posets is shown to be false.
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.
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 use cellular resolutions of monomial ideals to prove an analog of Hilbert's syzygy theorem for virtual resolutions of monomial ideals on smooth toric varieties.
In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an ideal, and some fundamental results on the integral closure of a monomial ideal.
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub-hypergraphs can be obtained; these results generalize our previous work on the edge ideals of simple graphs. We introduce a class of hypergraphs, which we call properly-connected, that naturally general…
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 Δ.
Let $\mm=(m_0,...,m_n)$ be an arithmetic sequence, i.e., a sequence of integers $m_0<...<m_n$ with no common factor that minimally generate the numerical semigroup $\sum_{i=0}^{n}m_i\N$ and such that $m_i-m_{i-1}=m_{i+1}-m_i$ for all $i\in\{1,...,n-1\}$. The homogeneous coordinate ring $Γ_\mm$ of the affine monomial curve parametrically defined by $X_0=t^{m_0},...,X_n=t^{m_n}$ is a graded $R$-module where $R$ is the polynomial ring $k[X_0,...,X_n]$ with the grading obtained by setting $°{X_i}:=m_i$. In this paper, we construct an explicit minimal graded free resolution for $Γ_\mm$ and show tha…
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.
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.
We give a combinatorial description of the roots of the Bernstein-Sato polynomial of a monomial ideal using the Newton polyhedron and some semigroups associated to the ideal.
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.
Let $\mm=(m_0,m_1,m_2,n)$ be an almost arithmetic sequence, i.e., a sequence of positive integers with ${\rm gcd}(m_0,m_1,m_2,n) = 1$, such that $m_0<m_1<m_2$ form an arithmetic progression, $n$ is arbitrary and they minimally generate the numerical semigroup $Γ= m_0\N + m_1\N + m_2\N + n\N$. Let $k$ be a field. The homogeneous coordinate ring $k[Γ]$ of the affine monomial curve parametrically defined by $X_0=t^{m_0},X_{1}=t^{m_1},X_2=t^{m_3},Y=t^{n}$ is a graded $R$-module, where $R$ is the polynomial ring $k[X_0,X_1,X_3, Y]$ with the grading $°{X_i}:=m_i, °{Y}:=n$. In this paper, we construc…
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.
A direct proof is presented of a form of Alvise Trevisan's result, that every monomial ideal ring is represented by the cohomology of topological space. Certain of these rings are shown to be realized by polyhedral products indexed by simplicial complexes.
The support poset of a monomial ideal $I\subseteq\mathbf{k}[x_1,\dots,x_n]$ encodes the relation between the variables $x_1,\dots,x_n$ and the minimal monomial generators of $I$. It is known that not every poset is realizable as the support poset of some monomial ideal. We describe some posets $P$ for which we can explicitly find at least one monomial ideal $I_P$ such that $P$ is the support poset of $I_P$. Also, for some families of monomial ideals we describe their support posets and study their properties. As an example of application we examine the relation between forests and series-paral…
The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas.
We show that the real parts of the poles of the Igusa zeta function of a monomial ideal can be computed from the torus-invariant divisors on the normalized blowing-up along the ideal. Moreover, we show that every such number is a root of the Bernstein-Sato polynomial associated to the monomial ideal.
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.
In this paper, by a modification of a previously constructed minimal free resolution for a transversal monomial ideal, the Betti numbers of this ideal is explicitly computed. For convenient characteristics of the ground field, up to a change of coordinates, the ideal of $t$-minors of a generic pluri-circulant matrix is a transversal monomial ideal . Using a Gröbner basis for this ideal, it is shown that the initial ideal of a generic pluri-circulant matrix is a stable monomial ideal when the matrix has two square blocks. By means of the Eliahou-Kervair resolution, the Betti numbers of this ini…
We show that the defining ideal of every monomial curve in the affine or projective three-dimensional space can be set-theoretically defined by three binomial equations, two of which set-theoretically define a determinantal ideal generated by the 2-minors of a $2\times 3$ matrix with monomial entries.
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.
In this paper we consider the local cohomology of monomial ideals with respect to monomial prime ideals and show that all these local cohomology modules are tame.
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.
The goal of this paper is to produce a formula for the multiplier ideals of monomial space curves in the spirit of Howald's formula for the multiplier ideals of monomial ideals. This is achieved by constructing a toric blowup of affine space in such a way that a log resolution of the monomial curve may be constructed from this toric variety in a well controlled manner.
Let $I$ be a monomial ideal of a polynomial ring $R$. In this paper we determine a number $B$ such that $\Ass (I^n/I^{n+1}) = \Ass (I^{B}/I^{B+1})$ for all $n\geq B$.
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.
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.