Generalized Frobenius powers of an ideal were introduced in work of Hernández, Teixeira, and Witt as characteristic-dependent analogs of test ideals. However, little is known about the Frobenius powers and critical exponents of specific ideals, even in the monomial case. We describe an algorithm to compute the critical exponents of monomial ideals and use this algorithm to prove some results about their Frobenius powers and critical exponents. Rather than using test ideals, our algorithm uses techniques from linear optimization.
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.
In this paper, we characterize the (generalized) Frobenius powers and critical exponents of two classes of monomial ideals of a polynomial ring in positive characteristic: powers of the homogeneous maximal ideal, and ideals generated by positive powers of the variables. In doing so, we effectively characterize the test ideals and $F$-jumping exponents of sufficiently general homogeneous polynomials, and of all diagonal polynomials. Our characterizations make these invariants computable, and show that they vary uniformly with the congruence class of the characteristic modulo a fixed integer. Mo…
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.
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 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.
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.
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.
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.
We introduce a new class of monomial ideals, called strong Borel type ideals, and we compute the Mumford-Castelnouvo regularity for principal strong Borel type ideals. Also, we describe the d-fixed ideals generated by powers of variables and we compute their regularity.
We study the deformation theory of quotients of polynomial rings by quadratic monomial ideals. More precisely we compute the first cotangent cohomology module of such rings. We also give a criterion for vanishing of second cotangent cohomology module.
We give explicit formulas for the Bhattacharya function of m-primary complete monomial ideals in two variables in terms of the vertices of the Newton polyhedra or in terms of the decompositions of the ideals as products of simple ideals.
We give a generalization of Hochster's formula for local cohomologies of square-free monomial ideals to monomial ideals, which are not necessarily square-free. Using this formula, we give combinatorial characterizations of generalized Cohen-Macaulay monomial ideals. We also give other applications of the generalized Hochster's formula.
Given a monomial ideal in a polynomial ring over a field, we define the LCM-dual of the given ideal. We show good properties of LCM-duals. Including the isomorphism between the special fiber of LCM-dual and the special fiber of given monomial ideal. We show the special fibers of LCM-duals of strongly stable ideals are normal Cohen-Macaulay Koszul domains. We provide an explicit describing of minimal free resolutions of LCM-duals of strongly stable ideals.
In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial ideals that come out as linear combinations of two normal ideals are shown to be not necessarily normal; under such a case we investigate the integral closedness of all powers of these ideals.
In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated LCM lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial ideal whose LCM lattice is P, and we give a complete characterization of all such coordinatizations. We prove that all relations in the lattice L(n) of all finite atomic lattices with n ordered atoms can be realized as deformations of exponents of monomial ideals. We also give structural results for L(n). Moreover, we prove that the cellular structure of a min…
We derive two general bounds for the depths of powers of squarefree monomial ideals corresponding to hyperforests. These bounds generalize known bounds for the depths of squarefree monomial ideals, which were given in terms of the edgewise domination number of the corresponding hypergraphs and the lengths of initially regular sequences with respect to the ideals.
We prove that the Stanley's conjecture holds for monomial ideals $I\subset K[x_1,...,x_n]$ generated by at most $2n-1$ monomials, i.e. $sdepth(I)\geq depth(I)$.
We give a new proof of Hilbert's Syzygy Theorem for monomial ideals. In addition, we prove the following. If S=k[x_1,...,x_n] is a polynomial ring over a field, M is a squarefree monomial ideal in S, and each minimal generator of M has degree larger than i, then the projective dimension of S/M is at most n-i.
We show that all monomial ideals in the polynomial ring in at most 3 variables are pretty clean and that an arbitrary monomial ideal $I$ is pretty clean if and only if its polarization $I^p$ is clean. This yields a new characterization of pretty clean monomial ideals in terms of the arithmetic degree, and it also implies that a multicomplex is shellable if and only the simplicial complex corresponding to its polarization is (non-pure) shellable. We also discuss Stanley decompositions in relation to prime filtrations.
Let $I$ be a weakly polymatroidal ideal or a squarefree monomial ideal of a polynomial ring $S$. In this paper we provide a lower bound for the Stanley depth of $I$ and $S/I$. In particular we prove that if $I$ is a squarefree monomial ideal which is generated in a single degree, then ${\rm sdepth}(I)\geq n-\ell(I)+1$ and ${\rm sdepth}(S/I)\geq n-\ell(I)$, where $\ell(I)$ denotes the analytic spread of $I$. This proves a conjecture of the author in a special case.
We study the WLP and SLP of artinian monomial ideals in $S=\mathbb{K}[x_1,\dots ,x_n]$ via studying their minimal free resolutions. We study the Lefschetz properties of such ideals where the minimal free resolution of $S/I$ is linear for at least $n-2$ steps. We give an affirmative answer to a conjecture of Eisenbud, Huneke and Ulrich for artinian monomial ideals with almost linear resolutions.
Let $I\supsetneq J$ be two monomial ideals of a polynomial algebra over a field generated in degree $\geq d$, resp. $\geq d+1$ . We study when the Stanley Conjecture holds for $I/J$ using the recent result of \cite{IKM} concerning the polarization.
We give an affirmative answer to a question due to J. He and A. Van Tuyl, proving that the arithmetical rank of a special monomial ideal equals to the projective dimension of corresponding quotient module.
The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that the second algorithm is more efficient than the first one for generic monomial ideals. Furthermore, the time complexity of the second algorithm is at most $O(n^2p\ell)$ where $n$ is the number of variables…
We show that the Stanley's Conjecture holds for an intersection of four monomial prime ideals of a polynomial algebra $S$ over a field and for an arbitrary intersection of monomial prime ideals $(P_i)_{i\in [s]}$ of $S$ such that $P_i\not\subset Σ_{1=j\not =i}^s P_j$ for all $i\in [s]$.
