Certain Minimal Varieties Are Set-Theoretic Complete Intersections

We present a class of homogeneous ideals which are generated by monomials and binomials of degree 2 and are set-theoretic complete intersections. This class includes certain reducible varieties of minimal degree and, in particular, the presentation ideals of the fiber cone algebras of monomial varieties of codimension 2.     

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.     

Certain monomial ideals whose numbers of generators of powers descend

Archiv der Mathematik - This paper studies the numbers of minimal generators of powers of monomial ideals in polynomial rings. For a monomial ideal I in two variables, Eliahou, Herzog, and Saem...     

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.     

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.     

Multigraded commutative algebra of graph decompositions

The toric fiber product is a general procedure for gluing two ideals, homogeneous with respect to the same multigrading, to produce a new homogeneous ideal. Toric fiber products generalize familiar constructions in commutative algebra like adding monomial ideals and the Segre product. We describe how to obtain generating sets of toric fiber products in non-zero codimension and discuss persistence of normality and primary decompositions under toric fiber products. Several applications are discussed, including (a) the construction of Markov bases of hierarchical models in many new cases, (b) a new proof of the quartic generation of binary graph models associated to K ₄-minor free graphs, and (c) the recursive computation of primary decompositions of conditional independence 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.     

The monomial ideal of a finite meet-semilattice

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.

     

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.     

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.     

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.     

Monomial ideals with tiny squares and Freiman ideals

Czechoslovak Mathematical Journal - We provide a construction of monomial ideals in R = K[x, y] such that μ(I2) < μ(I), where μ denotes the least number of generators. This...     

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.     

A criterion for tangential flatness

We prove that a local homomorphism induces a flat homomorphism of the graduations with respect to the maximal ideals iff it is flat itself and the tangent cone of the fiber is just the fiber of the tangent cone mapping. More explicit, the statement we want to prove here is as follows.     

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.     

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.     

Generalized multiplicities of edge ideals

We explore connections between the generalized multiplicities of square-free monomial ideals and the combinatorial structure of the underlying hypergraphs using methods of commutative algebra and polyhedral geometry. For instance, we show that the j-multiplicity is multiplicative over the connected components of a hypergraph, and we explicitly relate the j-multiplicity of the edge ideal of a properly connected uniform hypergraph to the Hilbert–Samuel multiplicity of its special fiber ring. In addition, we provide general bounds for the generalized multiplicities of the edge ideals and compute these invariants for classes of uniform hypergraphs.