Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution

In this paper we extend one direction of Fröberg?s theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the introduction of d-chorded and orientably-d-cycle-complete simplicial complexes. We show that a certain class of simplicial complexes, the d-dimensional trees, correspond to ideals having linear resolutions over fields of characteristic 2 and we also give a necessary combinatorial condition for a monomial ideal to be componentwise linear over all fields.     

Cohen–Macaulayness of monomial ideals and symbolic powers of Stanley–Reisner ideals

We present criteria for the Cohen–Macaulayness of a monomial ideal in terms of its primary decomposition. These criteria allow us to use tools of graph theory and of linear programming to study the Cohen–Macaulayness of monomial ideals which are intersections of prime ideal powers. We can characterize the Cohen–Macaulayness of the second symbolic power or of all symbolic powers of a Stanley–Reisner ideal in terms of the simplicial complex. These characterizations show that the simplicial complex must be very compact if some symbolic power is Cohen–Macaulay. In particular, all symbolic powers are Cohen–Macaulay if and only if the simplicial complex is a matroid complex. We also prove that the Cohen–Macaulayness can pass from a symbolic power to another symbolic powers in different ways.     

Ideals with linear quotients

We study basic properties of monomial ideals with linear quotients. It is shown that if the monomial ideal I has linear quotients, then the squarefree part of I and each component of I as well as mI have linear quotients, where m is the graded maximal ideal of the polynomial ring. As an analogy to the Rearrangement Lemma of Björner and Wachs we also show that for a monomial ideal with linear quotients the admissible order of the generators can be chosen degree increasingly.     

Resolutions of Facet Ideals

Abstract

In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determine the projective dimension and the regularity of I if the tree is 1-dimensional, show that the graded Betti numbers of I satisfy an alternating sum property if the tree is connected in codimension 1, and classify all trees whose facet ideal has a linear resolution.     

The facet ideal of a simplicial complex

 To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By generalizing the notion of a tree from graphs to simplicial complexes, we show that ideals associated to trees satisfy sliding depth condition, and therefore have normal and Cohen-Macaulay Rees rings. We also discuss connections with the theory of Stanley-Reisner rings. Received: 7 January 2002 / Revised version: 6 May 2002     

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.     

Zero-Dimensional Imbeddability

In this article, we try to understand which generically complete intersection monomial ideals with fixed radical are Cohen–Macaulay. We are able to give a complete characterization for a special class of simplicial complexes, namely the Cohen–Macaulay complexes without cycles in codimension 1. Moreover, we give sufficient conditions when the square-free monomial ideal has minimal multiplicity.     

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.     

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.     

Symbolic powers of monomial ideals and vertex cover algebras

We introduce and study vertex cover algebras of weighted simplicial complexes. These algebras are special classes of symbolic Rees algebras. We show that symbolic Rees algebras of monomial ideals are finitely generated and that such an algebra is normal and Cohen-Macaulay if the monomial ideal is squarefree. For a simple graph, the vertex cover algebra is generated by elements of degree 2, and it is standard graded if and only if the graph is bipartite. We also give a general upper bound for the maximal degree of the generators of vertex cover algebras.     

Skeletons of monomial ideals

In analogy to the skeletons of a simplicial complex and their Stanley–Reisner ideals we introduce the skeletons of an arbitrary monomial ideal I ? S = K [x₁, …, x_n ]. This allows us to compute the depth of S /I in terms of its skeleton ideals. We apply these techniques to show that Stanley's conjecture on Stanley decompositions of S /I holds provided it holds whenever S /I is Cohen–Macaulay. We also discuss a conjecture of Soleyman Jahan and show that it suffices to prove his conjecture for monomial ideals with linear resolution (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

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.

     

Cohen–Macaulay monomial ideals of codimension 2

We give a structure theorem for Cohen–Macaulay monomial ideals of codimension 2, and describe all possible relation matrices of such ideals. In case that the ideal has a linear resolution, the relation matrices can be identified with the spanning trees of a connected chordal graph with the property that each distinct pair of maximal cliques of the graph has at most one vertex in common.     

Initial ideals of tangent cones to Schubert varieties in orthogonal Grassmannians

We compute the initial ideals, with respect to certain conveniently chosen term orders, of ideals of tangent cones at torus fixed points to Schubert varieties in orthogonal Grassmannians. The initial ideals turn out to be square-free monomial ideals and therefore define Stanley-Reisner face rings of simplicial complexes. We describe these complexes. The maximal faces of these complexes encode certain sets of non-intersecting lattice paths.     

Koszul incidence algebras, affine semigroups, and Stanley-Reisner ideals

We prove a theorem unifying three results from combinatorial homological and commutative algebra, characterizing the Koszul property for incidence algebras of posets and affine semigroup rings, and characterizing linear resolutions of squarefree monomial ideals. The characterization in the graded setting is via the Cohen-Macaulay property of certain posets or simplicial complexes, and in the more general nongraded setting, via the sequential Cohen-Macaulay property.     

On a conjecture by Kalai

We show that monomial ideals generated in degree two satisfy a conjecture by Eisenbud, Green and Harris. In particular, we give a partial answer to a conjecture of Kalai by proving that h-vectors of flag Cohen-Macaulay simplicial complexes are h-vectors of Cohen-Macaulay balanced simplicial complexes.     

GROEBNER BASES FOR CONSTRUCTIBLE SETS

ABSTRACT

A constructible set can be defined in terms of a unique sequence of varieties. Given a monomial ordering, the reduced Groebner bases of the ideals of these varieties comprise a complete invariant for the constructible set. Morphic images of varieties, such as orbits under algebraic group actions and projections of varieties, can therefore be assigned complete invariants.     

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.