Linear resolutions of quadratic monomial ideals

We study the minimal free resolution of a quadratic monomial ideal in the case where the resolution is linear. First, we focus on the squarefree case, namely that of an edge ideal. We provide an explicit minimal free resolution under the assumption that the graph associated with the edge ideal satisfies specific combinatorial conditions. In addition, we construct a regular cellular structure on the resolution. Finally, we extend our results to non-squarefree ideals by means of polarization.     

Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph ℋ appears within the resolution of its edge ideal ℐ(ℋ). We discuss when recursive formulas to compute the graded Betti numbers of ℐ(ℋ) in terms of its sub-hypergraphs can be obtained; these results generalize our previous work (Hà, H.T., Van Tuyl, A. in J. Algebra 309:405–425, 2007) on the edge ideals of simple graphs. We introduce a class of hypergraphs, which we call properly-connected, that naturally generalizes simple graphs from the point of view that distances between intersecting edges are “well behaved.” For such a hypergraph ℋ (and thus, for any simple graph), we give a lower bound for the regularity of ℐ(ℋ) via combinatorial information describing ℋ and an upper bound for the regularity when ℋ=G is a simple graph. We also introduce triangulated hypergraphs that are properly-connected hypergraphs generalizing chordal graphs. When ℋ is a triangulated hypergraph, we explicitly compute the regularity of ℐ(ℋ) and show that the graded Betti numbers of ℐ(ℋ) are independent of the ground field. As a consequence, many known results about the graded Betti numbers of forests can now be extended to chordal graphs. Dedicated to Anthony V. Geramita on the occasion of his 65th birthday.     

Sequentially Cohen-Macaulay edge ideals

Let be a simple undirected graph on vertices, and let denote its associated edge ideal. We show that all chordal graphs are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of is componentwise linear. Our result complements Faridi's theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and implies Herzog, Hibi, and Zheng's theorem that a chordal graph is Cohen-Macaulay if and only if its edge ideal is unmixed. We also characterize the sequentially Cohen-Macaulay cycles and produce some examples of nonchordal sequentially Cohen-Macaulay graphs.

     

Cellular Structure on the Minimal Resolution of the Edge Ideal of the Complement of the n-Cycle

We study the minimal free resolution of the edge ideal of the complement of the n-cycle for n ≥ 4 and construct a regular cellular complex which supports this resolution.     

Stability of associated primes of integral closures of monomial ideals

Let I be a monomial ideal of a polynomial ring R=K[X₁,…,Xr] and d(I) the maximal degree of minimal generators of I. In this paper, we explicitly determine a number n₀ in terms of r and d(I) such that for all n?n₀. Furthermore, our n₀ is almost sharp.     

An elementary approach to containment relations between symbolic and ordinary powers of certain monomial ideals

We provide an elementary explanation of a surprising result of Ein–Lazarsfeld–Smith and Hochster–Huneke on the containment between symbolic and ordinary powers of ideals for a certain class of simple monomial ideals.     

Path ideals of rooted trees and their graded Betti numbers

Let Γ be a rooted (and directed) tree, and let t be a positive integer. The path ideal It(Γ) is generated by monomials that correspond to directed paths of length (t−1) in Γ. In this paper, we study algebraic properties and invariants of It(Γ). We give a recursive formula to compute the graded Betti numbers of It(Γ) in terms of path ideals of subtrees. We also give a general bound for the regularity, explicitly compute the linear strand, and investigate when It(Γ) has a linear resolution.     

Intersections of Leray complexes and regularity of monomial ideals

For a simplicial complex X and a field K, let .It is shown that if X,Y are complexes on the same vertex set, then for k?0

     

CW-resolutions of monomial ideals that are supported on face posets

Given a monomial ideal I with minimal free resolution ? supported in characteristic p>0 on a CW-complex X with regular 2-skeleton, in general it is not the case that the face poset of X, P(X), also supports ? in the sense of Clark and Tchernev. We construct a (not necessarily regular) CW-complex Y that also supports ? and such that the face poset P(Y) also supports ?.     

The core of zero-dimensional monomial ideals

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.     

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.     

type free resolutions of monomial ideals

Let be a monomial ideal of . Bayer-Peeva-Sturmfels studied a subcomplex of the Taylor resolution, defined by a simplicial complex . They proved that if is generic (i.e., no variable appears with the same non-zero exponent in two distinct monomials which are minimal generators), then is the minimal free resolution of , where is the Scarf complex of . In this paper, we prove the following: for a generic (in the above sense) monomial ideal and each integer , there is an embedded prime of . Thus a generic monomial ideal with no embedded primes is Cohen-Macaulay (in this case, is shellable). We also study a non-generic monomial ideal whose minimal free resolution is for some . In particular, we prove that if all associated primes of have the same height, then is Cohen-Macaulay and is pure and strongly connected.

     

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)     

Minimal prime ideals in enveloping algebras of Lie superalgebras

Let be a finite dimensional Lie superalgebra over a field of characteristic zero. Let be the enveloping algebra of . We show that when , then is not semiprime, but it has a unique minimal prime ideal; it follows then that when is classically simple, has a unique minimal prime ideal. We further show that when is a finite dimensional nilpotent Lie superalgebra, then has a unique minimal prime ideal.

     

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.     

Powers of ideals associated to (C4,2K2)-free graphs

Let G be a $(C_4,2K_2)$-free graph with edge ideal $I(G)?\mathbb{k}[x_1,\dots ,x_n]$. We show that $I{(G)}^s$ has linear resolution for every $s\ge 2$. Also, we show that every power of the vertex cover ideal of G has linear quotients. As a result, we describe the Castelnuovo–Mumford regularity of powers of $I{(G)}^{\vee }$ in terms of the maximum degree of G.     

On the regularity of binomial edge ideals

We study the regularity of binomial edge ideals. For a closed graph G we show that the regularity of the binomial edge ideal coincides with the regularity of and can be expressed in terms of the combinatorial data of G. In addition, we give positive answers to Matsuda‐Murai conjecture 8 for some classes of graphs.