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.     

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.     

Taylor complexes for Koszul boundaries

For all boundary modules of the Koszul complex of a monomial sequence we construct complexes, which we call Taylor complexes. For a monomial d-sequences these complexes provide free resolutions of the boundary modules. Let M be the ideal generated by a monomial d-sequence. We use the Taylor complexes to construct minimal free resolutions of the Rees algebra and the associated graded ring of M. Received: 13 November 1997 / Revised version: 6 March 1998     

Minimal free resolutions that are not supported by a CW-complex

We provide the first examples of minimal free resolutions of monomial ideals which cannot be supported by any CW-complex. Their existence answers negatively the fundamental question of whether every monomial ideal admits a minimal cellular resolution.     

Trees, parking functions, syzygies, and deformations of monomial ideals

For a graph , we construct two algebras whose dimensions are both equal to the number of spanning trees of . One of these algebras is the quotient of the polynomial ring modulo certain monomial ideal, while the other is the quotient of the polynomial ring modulo certain powers of linear forms. We describe the set of monomials that forms a linear basis in each of these two algebras. The basis elements correspond to -parking functions that naturally came up in the abelian sandpile model. These ideals are instances of the general class of monotone monomial ideals and their deformations. We show that the Hilbert series of a monotone monomial ideal is always bounded by the Hilbert series of its deformation. Then we define an even more general class of monomial ideals associated with posets and construct free resolutions for these ideals. In some cases these resolutions coincide with Scarf resolutions. We prove several formulas for Hilbert series of monotone monomial ideals and investigate when they are equal to Hilbert series of deformations. In the appendix we discuss the abelian sandpile model.

     

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.     

The Nash sheaf of a complete resolution

Every three-dimensional complex algebraic variety with isolated singular point has a resolution factoring through the Nash blowup and the blowup of the maximal ideal over which the second Fitting ideal sheaf is locally principal. In such resolutions one can construct Hsiang–Pati coordinates and thus obtain generators for the Nash sheaf that are the differentials of monomial functions. Received: 9 April 2001 / Revised version: 26 July 2001     

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     

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.     

Koszul Algebras and Their Ideals

We study associative graded algebras that have a “complete flag” of cyclic modules with linear free resolutions, i.e., algebras over which there exist cyclic Koszul modules with any possible number of relations (from zero to the number of generators of the algebra). Commutative algebras with this property were studied in several papers by Conca and others. Here we present a noncommutative version of their construction.We introduce and study the notion of Koszul filtration in a noncommutative algebra and examine its connections with Koszul algebras and algebras with quadratic Grobner bases. We consider several examples, including monomial algebras, initially Koszul algebras, generic algebras, and algebras with one quadratic relation. It is shown that every algebra with a Koszul filtration has a rational Hilbert series.__________Translated from Funktsional’nyi Analiz i Ego Prilozheniya, Vol. 39, No. 2, pp. 47–60, 2005Original Russian Text Copyright © by D. I. PiontkovskiiSupported in part by the Russian Foundation for Basis Research under project 02-01-00468.     

t-clique ideal and t-independence ideal of a graph

In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized. Moreover, some families of graphs for which the quotient ring of their clique ideal is Cohen–Macaulay are introduced and some homological invariants of the clique ideal of a graph G, which is the complement of a path graph or a cycle graph, are obtained. Also some algebraic properties of the independence ideal of path graphs, cycle graphs and chordal graphs are studied.     

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.

     

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.     

On Igusa zeta functions of monomial ideals

We show that the real parts of the poles of the Igusa zeta function of a monomial ideal can be computed from the torus-invariant divisors on the normalized blow-up of the affine space along the ideal. Moreover, we show that every such number is a root of the Bernstein-Sato polynomial associated to the monomial ideal.

     

Resolutions of monomial almost complete intersections and generalizations

Let S=K[x₁,…,x_n] be a polynomial ring over a field kand let / be a monomial ideal of S. The main result of this paper is an explicit minimal resolution of kover R= S/Iwhen / is a monomial almost complete intersection ideal of S. We also compute an upper bound on the multigraded resolution of k over a generalization of monomial almost complete intersection ring.     

Generalized mixed product ideals

We consider classes of ideals which generalize the mixed product ideals introduced by Restuccia and Villarreal (see [5]), and also generalize the expansion construction by Bayati and Herzog [1]. We compute the minimal graded free resolution of generalized mixed product ideals and show that the regularity of a generalized mixed product ideal coincides with the regularity of the monomial ideal by which it is induced.     

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 Ideals of Forest Type

As a generalization of the facet ideal of a forest, we define monomial ideal of forest type and show that monomial ideals of forest type are pretty clean. As a consequence, we show that if I is a monomial ideal of forest type in the polynomial ring S, then Stanley's decomposition conjecture holds for S/I. The other main result of this article shows that a clutter is totally balanced if and only if it has the free vertex property, and which is also equivalent to say that its edge ideal is a monomial ideal of forest type or is generated by an M sequence.     

New generalized almost perfect nonlinear functions

APN (almost perfect non-linear) functions over finite fields of even characteristic are widely studied due to their applications to the design of symmetric ciphers resistant to differential attacks. This notion was recently generalized to GAPN (generalized APN) functions by Kuroda and Tsujie to odd characteristic p. They presented some constructions of GAPN functions, and other constructions were given by Zha et al. We present new constructions of GAPN functions both in the case of monomial and multinomial functions. Our monomial GAPN functions can be viewed as a further generalization of the Gold APN functions. We show that a certain technique used by Hou to construct permutations over finite fields also yields monomial GAPN functions. We also present several new constructions of GAPN functions which are sums of monomial GAPN functions, as well as new GAPN functions of degree p which can be written as the product of two powers of linearized polynomials. For this latter construction we describe some interesting differences between even and odd characteristic and also obtain a classification in certain cases.     

Quasi-Frobenius Rings and Nakayama Permutations of Semiperfect Rings

We say that is a ring with duality for simple modules, or simply a DSM-ring, if, for every simple right (left) -module U, the dual module U* is a simple left (right) -module. We prove that a semiperfect ring is a DSM-ring if and only if it admits a Nakayama permutation. We introduce the notion of a monomial ideal of a semiperfect ring and study the structure of hereditary semiperfect rings with monomial ideals. We consider perfect rings with monomial socles.