ALGORITHMS ON PARAMETRIC DECOMPOSITION OF MONOMIAL IDEALS

ABSTRACT

Heinzer, Mirbagheri, Ratliff, and Shah investigate parametric decomposition of monomial ideals on a regular sequence of a commutative ring R with identity 1 and prove that if every finite intersection of monomial ideals in R is again a monomial ideal, then each monomial ideal has a unique irredundant parametric decomposition. Sturmfels, Trung, and Vogels prove a similar result without the uniqueness. Bayer, Peeva, and Strumfels study generic monomial ideals, that is monomial ideals in the polynomial ring such that no variable appears with the same nonzero exponent in two different minimal generators, and for these ideals they prove the uniqueness of the irredundant irreducible decompositions and give an algorithm to construct this unique irredundant irreducible decomposition. In this paper, we present three algorithms for finding the unique irredundant irreducible decomposition of any monomial ideal.     

Monomial localizations and polymatroidal ideals

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.     

On the stable set of associated prime ideals of a monomial ideal

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.     

Combinatorial symbolic powers

Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph and its blowups. As a result, perfect graphs play an important role in the theory, dual to the role played by perfect graphs in the theory of secants of monomial ideals. We use Gröbner degenerations as a tool to reduce questions about symbolic powers of arbitrary ideals to the monomial case. Among the applications are a new, unified approach to the Gröbner bases of symbolic powers of determinantal and Pfaffian ideals.     

Stanley Depth of Quotient of Monomial Complete Intersection Ideals

We compute the Stanley depth for a particular but important case of the quotient of complete intersection monomial ideals. Also, in the general case, we give sharp bounds for the Stanley depth of a quotient of complete intersection monomial ideals. In particular, we prove the Stanley conjecture for quotients of complete intersection monomial ideals.     

Certain variants of multipermutohedron ideals

Multipermutohedron ideals have rich combinatorial properties. An explicit combinatorial formula for the multigraded Betti numbers of a multipermutohedron ideal and their Alexander duals are known. Also, the dimension of the Artinian quotient of an Alexander dual of a multipermutohedron ideal is the number of generalized parking functions. In this paper, monomial ideals which are certain variants of multipermutohedron ideals are studied. Multigraded Betti numbers of these variant monomial ideals and their Alexander duals are obtained. Further, many interesting combinatorial properties of multipermutohedron ideals are extended to these variant monomial ideals.     

On pseudo symmetric monomial curves

We study monomial curves, toric ideals and monomial algebras associated to 4-generated pseudo symmetric numerical semigroups. Namely, we determine indispensable binomials of these toric ideals, give a characterization for these monomial algebras to have strongly indispensable minimal graded free resolutions. We also characterize when the tangent cones of these monomial curves at the origin are Cohen–Macaulay.     

Tameness of local cohomology of monomial ideals with respect to monomial prime 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.     

Associated radical ideals of monomial ideals

Algebraic and combinatorial properties of a monomial ideal are studied in terms of its associated radical ideals. In particular, we present some applications to the symbolic powers of square-free monomial ideals.     

Stanley decompositions and partitionable simplicial complexes

We study Stanley decompositions and show that Stanley’s conjecture on Stanley decompositions implies his conjecture on partitionable Cohen–Macaulay simplicial complexes. We also prove these conjectures for all Cohen–Macaulay monomial ideals of codimension 2 and all Gorenstein monomial ideals of codimension 3. Dedicated to Takayuki Hibi on the occasion of his fiftieth birthday.     

Prime Filtrations and Primary Decompositions of Modules

We give a new characterization for prime filtrations of an R-module M in terms of primary decomposition of the zero submodule of M. Using this characterization we prove that some classes of monomial ideals like generic and cogeneric monomial ideals are clean, pretty clean, or almost clean.     

Cohen-Macaulay monomial ideals with given radical

We study the set of Cohen-Macaulay monomial ideals with a given radical. Among this set of ideals are the so-called Cohen-Macaulay modifications. Not all Cohen-Macaulay squarefree monomial ideals admit nontrivial Cohen-Macaulay modifications. It is shown that if there exists one such modification, then there exist indeed infinitely many.     

Constructible Ideals

Based on the study of simplicial complexes, one may naturally define the constructible monomial ideals. We connect the square-free constructible ideal with the Stanley–Reisner ideal of the Alexander dual associated to a constructible simplicial complex. We give some properties of constructible ideals, and we compute the Betti numbers. We prove that all monomial ideals with linear quotients are constructible ideals. We also show that all constructible ideals have a linear resolution.     

Betti-linear ideals

We introduce the notion of a Betti-linear monomial ideal, which generalizes the notion of lattice-linear monomial ideal introduced by Clark. We provide a characterization of Betti-linearity in terms of Tchernev's poset construction. As an application we obtain an explicit canonical construction for the minimal free resolutions of monomial ideals having pure resolutions.     

Algebraic properties of classes of path ideals of posets

We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen–Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise in algebraic statistics from the Luce-decomposable model and the ascending model, can be viewed as path ideals of certain posets. We study invariants of these so-called Luce-decomposable monomial ideals and ascending ideals for diamond posets and products of chains. In particular, for these classes of posets, we explicitly compute their Krull dimension, their projective dimension, their Castelnuovo–Mumford regularity and their Betti numbers.     

On the fiber cone of monomial ideals

Archiv der Mathematik - We consider the fiber cone of monomial ideals. It is shown that for monomial ideals $$I\subset K[x,y]$$ of height 2, generated by 3 elements, the fiber cone F(I) of I is a...     

Convex bodies and asymptotic invariants for powers of monomial ideals

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 monomial ideal by means of a more easily computable invariant, which we introduce under the name of naive Waldschmidt constant.     

Reverse lex ideals

We study reverse lex ideals in a polynomial ring, and compare their properties to those of lex ideals. In particular we provide an analogue of Green's Theorem for reverse lex ideals. We also compare the Betti numbers of strongly stable and square-free strongly stable monomial ideals to those of reverse lex ideals.     

Standard graded vertex cover algebras, cycles and leaves

The aim of this paper is to characterize simplicial complexes which have standard graded vertex cover algebras. This property has several nice consequences for the squarefree monomial ideals defining these algebras. It turns out that such simplicial complexes are closely related to a range of hypergraphs which generalize bipartite graphs and trees. These relationships allow us to obtain very general results on standard graded vertex cover algebras which cover previous major results on Rees algebras of squarefree monomial ideals.