On the index of powers of edge ideals

The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper, we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a function of the power of an edge ideal I is strictly increasing if I is linearly presented. Examples show that this needs not to be the case for monomial ideals generated in degree greater than two.     

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.     

The minimal free resolution of a Borel ideal

We consider the Eliahou–Kervaire minimal free resolution of a 0-Borel ideal and its applications.     

Resolutions of monomial ideals of projective dimension 1

We show that a monomial ideal I in a polynomial ring S has projective dimension ≤ 1 if and only if the minimal free resolution of S∕I is supported on a graph that is a tree. This is done by constructing specific graphs which support the resolution of the S∕I. We also provide a new characterization of quasi-trees, which we use to give a new proof to a result by Herzog, Hibi, and Zheng which characterizes monomial ideals of projective dimension 1 in terms of quasi-trees.     

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.     

Gröbner basis and free resolution of the ideal of 2-minors of a 2 × n matrix of linear forms *

We give a Gröbner basis for the ideal of 2-minors of a 2 × n utiatrix of linear forms. The minimal free resolution of such an ideal is obtained in [4] when the corresponding Kronecker-Weierstrass normal form has no iiilpotent blocks. For the general case, using this result, the Grobner basis and the Eliahou-Kervaire resolution for stable monomial ideals, we obtain a free resolution with the expected regularity. For a specialization of the defining ideal of ordinary pinch points, as a special case of these ideals, we provide a minimal free resolution explicitly in terms of certain Koszul complex.     

C4-free edge ideals

We discuss the linearity of the minimal free resolution of a power of a monomial edge ideal.     

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 ?.     

Polarizations and hook partitions

In this paper, we relate combinatorial conditions for polarizations of powers of the graded maximal ideal with rank conditions on submodules generated by collections of Young tableaux. We apply discrete Morse theory to the hypersimplex resolution introduced by Batzies–Welker to show that the L-complex of Buchsbaum and Eisenbud for powers of the graded maximal ideal is supported on a CW-complex. We then translate the “spanning tree condition” of Almousa–Fløystad–Lohne characterizing polarizations of powers of the graded maximal ideal into a condition about which sets of hook tableaux span a certain Schur module. As an application, we give a complete combinatorial characterization of polarizations of so-called “restricted powers” of the graded maximal ideal.     

Regularity,depth and arithmetic rank of bipartite edge ideals

We study minimal free resolutions of edge ideals of bipartite graphs. We associate a directed graph to a bipartite graph whose edge ideal is unmixed, and give expressions for the regularity and the depth of the edge ideal in terms of invariants of the directed graph. For some classes of unmixed edge ideals, we show that the arithmetic rank of the ideal equals projective dimension of its quotient.     

First Nonlinear Syzygies of Ideals Associated to Graphs

Consider an ideal I ? K[x ₁,…, x _n ], with K an arbitrary field, generated by monomials of degree two. Assuming that I does not have a linear resolution, we determine the step s of the minimal graded free resolution of I where nonlinear syzygies first appear, we show that at this step of the resolution nonlinear syzygies are concentrated in degree s + 3, and we compute the corresponding graded Betti number β _{s, s+3}. The multidegrees of these nonlinear syzygies are also determined and the corresponding multigraded Betti numbers are shown to be all equal to 1.     

Lyubeznik's Resolution and Rooted Complexes

We describe a new family of free resolutions for a monomial ideal I, generalizing Lyubeznik's construction. These resolutions are cellular resolutions supported on the rooted complexes of the lcm-lattice of I. Our resolutions are minimal for the matroid ideal of a finite projective space.     

Minimal projective resolutions

In this paper, we present an algorithmic method for computing a projective resolution of a module over an algebra over a field. If the algebra is finite dimensional, and the module is finitely generated, we have a computational way of obtaining a minimal projective resolution, maps included. This resolution turns out to be a graded resolution if our algebra and module are graded. We apply this resolution to the study of the -algebra of the algebra; namely, we present a new method for computing Yoneda products using the constructions of the resolutions. We also use our resolution to prove a case of the ``no loop' conjecture.

     

Graph representation of projective resolutions

We generalize the concept — dimension tree and the related results for monomial algebras to a more general case — relations algebras Λ by bringing Gröbner basis into play. More precisely, we will describe the minimal projective resolution of a left Λ-module M as a rooted ‘weighted’ diagraph to be called the minimal resolution graph for M. Algorithms for computing such diagraphs and applications as well will be presented.     

Virtual criterion for generalized Eagon-Northcott complexes

Given any map of finitely generated free modules, Buchsbaum and Eisenbud define a family of generalized Eagon-Northcott complexes associated to it [3]. We give sufficient criterion for these complexes to be virtual resolutions, thus adding to the known examples of virtual resolutions, particularly those not coming from minimal free resolutions.     

Generic lattice ideals

A concept of genericity is introduced for lattice ideals (and hence for ideals defining toric varieties) which ensures nicely structured homological behavior. For a generic lattice ideal we construct its minimal free resolution and we show that it is induced from the Scarf resolution of any reverse lexicographic initial ideal.