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 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 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.
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…
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.
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.
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$.
Many algebras are expected to have the Weak Lefschetz property though this is often very difficult to establish. We illustrate the subtlety of the problem by studying monomial and some closely related ideals. Our results exemplify the intriguing dependence of the property on the characteristic of the ground field, and on arithmetic properties of the exponent vectors of the monomials.
We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the minimal log-resolution of the ideal. Furthermore, the monomial expression given by our method is an equisingularity invariant of the ideal. As an outcome, we provide a geometric method to compute the integral closure of a planar ideal and we apply our algorithm to some families of complete ideals.
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.
It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial ideal.
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
In this paper, basic properties of monomial difference ideals are studied. We prove the finitely generated property of well-mixed difference ideals generated by monomials. Furthermore, a finite prime decomposition of radical well-mixed monomial difference ideals is given. As a consequence, we prove that every strictly ascending chain of radical well-mixed monomial difference ideals in a difference polynomial ring is finite, which answers a question raised by E. Hrushovski in the monomial case. Moreover, the Alexander Duality for monomial ideals is generalized to the monomial case.
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. …
We express the multigraded Betti numbers of monomial ideals in 4 variables in terms of the multigraded Betti numbers of 66 squarefree monomial ideals, also in 4 variables. We use this class of 66 ideals to prove that monomial resolutions in 4 variables are independent of the base field. In addition, we give a formula for the Betti numbers of an arbitrary monomial ideal in 4 variables.
The reduction number of monomial ideals in the polynomial $K[x,y]$ is studied. We focus on ideals $I$ for which $J=(x^a,y^b)$ is a reduction ideal. The computation of the reduction number amounts to solve linear inequalities. In some special cases the reduction number can be explicitly computed.
We study when Taylor resolutions of monomial ideals are minimal. We consider monomial ideals with linear quotients. In particular, we determine precisely the stable ideals and the monomial ideals with linear resolutions having the miminal Taylor resolutions.
We introduce the concept of quasi-linearity and prove it is necessary for a monomial ideal to have a linear resolution and identify all the quasi-linear quadratic monomial ideals. We define a strongly linear monomial for a monomial ideal $I$ and prove that if $\mathbf{u}$ is a strongly linear monomial over $I$ then $I$ has a linear resolution (resp: is quasi-linear) if and only if $I+\mathbf{u}\mathfrak{p}$ has a linear resolution (resp: is quasi-linear). Here $\mathfrak{p}$ is any monomial prime ideal.
In this thesis we are interested in describing some homological invariants of certain classes of monomial ideals. We will pay attention to the squarefree and non-squarefree lexsegment ideals.
Lyubeznik introduced the concept of size of a monomial ideal and showed that the size of a monomial ideal increased by $1$ is a lower bound for its depth. We show that the size is also a lower bound for its Stanley depth. Applying Alexander duality we obtain upper bounds for the regularity and Stanley regularity of squarefree monomial ideals.
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.
Let $S$ be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of $S$ having minimal depth. In particular, Stanley's conjecture holds for these ideals. Also we show that if Stanley's conjecture holds for a square free monomial ideal then it holds for all its trivial modifications.
We determine in an explicit way the depth of the fiber cone and its relation ideal for classes of monomial ideals in two variables. These classes include concave and convex ideals as well as symmetric ideals.
We show that $\depth(S/I)=0$ if and only if $\sdepth(S/I)=0$, where $I\subset S=K[x_1,...,x_n]$ is a monomial ideal. We give an algorithm to compute the Stanley depth of $S/I$, where $I\subset S=K[x_1,x_2,x_3]$ is a monomial ideal. Also, we prove that a monomial ideal $I\subset K[x_1,x_2,x_3]$ minimally generated by three monomials has $\sdepth(I)=2$.
We introduce an exact functor defined on multigraded modules which we call the expansion functor and study its homological properties. The expansion functor applied to a monomial ideal amounts to substitute the variables by monomial prime ideals and to apply this substitution to the generators of the ideal. This operation naturally occurs in various combinatorial contexts.
We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to deduce some finiteness results about leading monomial ideals of any fixed ideal, namely: (1) the number of minimal leading monomial ideals with respect to total orderings is finite; (2) the number of leading monomial ideals with respect to degree orderings is finite; (3) the number of leading monomial ideals with respect to admissible orderings is finite under …
In this paper, we show for a monomial ideal $I$ of $K[x_1,x_2,\ldots,x_n]$ that the integral closure $\ol{I}$ is a monomial ideal of Borel type (Borel-fixed, strongly stable, lexsegment, or universal lexsegment respectively), if $I$ has the same property. We also show that the $k^{th}$ symbolic power $I^{(k)}$ of $I$ preserves the properties of Borel type, Borel-fixed and strongly stable, and $I^{(k)}$ is lexsegment if $I$ is stably lexsegment. For a monomial ideal $I$ and a monomial prime ideal $P$, a new ideal $J(I, P)$ is studied, which also gives a clear description of the primary decompos…
We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.
Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of $I$. We prove that there exists a unique minimal monomial reduction ideal $J$ of $I$ and we show that the maximum degree of a monomial generator of $J$ determines the slope $p$ of the linear function $\reg(I^t)=pt+c$ for $t\gg 0$. We determine the structure of the reduced fiber ring $\mathcal{F}(J)_{\red}$ of $J$ and show that $\mathcal{F}(J)_{\red}$ is isomo…
Let S be a polynomial ring in n variables, over an arbitrary field. We give the total, graded, and multigraded Betti numbers of S/M, for every monomial ideal M in S. We also give an explicit characterization of all monomial ideals M in S for which the quotient S/M has projective dimension n.
We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to compute $v$ is given using Macaulay2 (Section 7). For squarefree monomial ideals the problem is related to the combinatorics of the underlying clutter or graph (Proposition 4.3). For ideals of Borel type the monomial $f$ takes a simpler form (Proposition 5.2). The authors classify when $f$ is unique (Proposition 6.2).
For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik ideal. In this paper, we characterize the Lyubeznik ideals, and we discover some classes of Lyubeznik 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.
We compute the Stanley depth of irreducible monomial ideals and we show that the Stanley depth of a monomial complete intersection ideal is the same as the Stanley depth of it's radical. Also, we give some bounds for the Stanley depth of a monomial complete intersection ideal.
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.
Let $J\subsetneq I$ be two ideals of a polynomial ring $S$ over a field, generated by square free monomials. We show that some inequalities among the numbers of square free monomials of $I\setminus J$ of different degrees give upper bounds of $\depth_SI/J$.
We introduce the class of lattice-linear monomial ideals and use the LCM-lattice to give an explicit construction for their minimal free resolution. The class of lattice-linear ideals includes (among others) the class of monomial ideals with linear free resolution and the class of Scarf monomial ideals. Our main tool is a new construction by Tchernev that produces from a map of posets $η:P\lra\mbb{N}^n$ a sequence of multigraded modules and maps.
Let $I$ be an $m$-generated complete intersection monomial ideal in $S=K[x_1,...,x_n]$. We show that the Stanley depth of $I$ is $n-\floor{\frac{m}{2}}$. We also study the upper-discrete structure for monomial ideals and prove that if $I$ is a squarefree monomial ideal minimally generated by 3 elements, then the Stanley depth of $I$ is $n-1$.
The Hilbert series of local cohomologies for monomial ideals, which are not necessarily square-free, is established. As applications, we give a sharp lower bound of the non-vanishing degree of local cohomologies and also a sharp lower bound of the positive integer k of k-Buchsbaumness for generalized Cohen-Macaulay monomial ideals.
In this paper we study the behavior of the size of a monomial ideal under polarization and under generic deformations. As an application, we extend a result relating the size and the Stanley depth of a squarefree monomial ideal obtained by Herzog, Popescu and Vladoiu, together with a parallel result obtained by Tang.
We compute the minimal primary decomposition for completely squarefree lexsegment ideals. We show that critical squarefree monomial ideals are sequentially Cohen-Macaulay. As an application, we give a complete characterization of the completely squarefree lexsegment ideals which are sequentially Cohen-Macaulay and we also derive formulas for some homological invariants of this class of ideals.
Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal in terms of the associated graph.
