On the associated primes and the depth of the second power of squarefree monomial ideals

We present combinatorial characterizations for the associated primes of the second power of squarefree monomial ideals and criteria for this power to have positive depth or depth greater than one.     

A note on monomial ideals

We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximum height of its minimal primes. Received: 12 December 2005     

Borel-plus-powers monomial ideals

Let S=K[x₁,…,x_n] be a standard graded polynomial ring over a field K. In this paper, we show that the lex-plus-powers ideal has the largest graded Betti numbers among all Borel-plus-powers monomial ideals with the same Hilbert function. In addition in the case of characteristic 0, by using this result, we prove the lex-plus-powers conjecture for graded ideals containing , where p is a prime number.     

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.     

The reconstruction conjecture and edge ideals

Given a simple graph G on n vertices, we prove that it is possible to reconstruct several algebraic properties of the edge ideal from the deck of G, that is, from the collection of subgraphs obtained by removing a vertex from G. These properties include the Krull dimension, the Hilbert function, and all the graded Betti numbers β_i,j where j<n. We also state many further questions that arise from our study.     

The structure of DGA resolutions of monomial ideals

Let $I?\mathbb{k}[x_1,\dots ,x_n]$ be a squarefree monomial ideal in a polynomial ring. In this paper we study multiplications on the minimal free resolution $\mathbb{F}$ of $\mathbb{k}[x_1,\dots ,x_n]/I$. In particular, we characterize the possible vectors of total Betti numbers for such ideals which admit a differential graded algebra (DGA) structure on $\mathbb{F}$. We also show that under these assumptions the maximal shifts of the graded Betti numbers are subadditive.On the other hand, we present an example of a strongly generic monomial ideal which does not admit a DGA structure on its minimal free resolution. In particular, this demonstrates that the Hull resolution and the Lyubeznik resolution do not admit DGA structures in general.Finally, we show that it is enough to modify the last map of $\mathbb{F}$ to ensure that it admits the structure of a DG algebra.     

Computing residue currents of monomial ideals using comparison formulas

Given a free resolution of an ideal a$\mathfrak{a}$ of holomorphic functions, one can construct a vector-valued residue current R  , which coincides with the classical Coleff–Herrera product if a$\mathfrak{a}$ is a complete intersection ideal and whose annihilator ideal is precisely a$\mathfrak{a}$.     

Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König type

Let C be a clutter with a perfect matching e₁,…,e_g of König type and let Δ_C be the Stanley-Reisner complex of the edge ideal of C. If all c-minors of C have a free vertex and C is unmixed, we show that Δ_C is pure shellable. We are able to describe, in combinatorial and algebraic terms, when Δ_C is pure. If C has no cycles of length 3 or 4, then it is shown that Δ_C is pure if and only if Δ_C is pure shellable (in this case e_i has a free vertex for all i), and that Δ_C is pure if and only if for any two edges f₁,f₂ of C and for any e_i, one has that f₁∩e_i⊂f₂∩e_i or f₂∩e_i⊂f₁∩e_i. It is also shown that this ordering condition implies that Δ_C is pure shellable, without any assumption on the cycles of C. Then we prove that complete admissible uniform clutters and their Alexander duals are unmixed. In addition, the edge ideals of complete admissible uniform clutters are facet ideals of shellable simplicial complexes, they are Cohen-Macaulay, and they have linear resolutions. Furthermore if C is admissible and complete, then C is unmixed. We characterize certain conditions that occur in a Cohen-Macaulay criterion for bipartite graphs of Herzog and Hibi, and extend some results of Faridi-on the structure of unmixed simplicial trees-to clutters with the König property without 3-cycles or 4-cycles.     

The Buchsbaum property of symbolic powers of Stanley-Reisner ideals of dimension 1

Let S be a polynomial ring and I be the Stanley-Reisner ideal of a simplicial complex Δ. The purpose of this paper is investigating the Buchsbaum property of S/I^(r) when Δ is pure dimension 1. We shall characterize the Buchsbaumness of S/I^(r) in terms of the graphical property of Δ. That is closely related to the characterization of the Cohen-Macaulayness of S/I^(r) due to the first author and N.V. Trung.     

Strongly irreducible ideals of a commutative ring

An ideal I of a ring R is said to be strongly irreducible if for ideals J and K of R, the inclusion J∩K⊆I implies that either J⊆I or K⊆I. The relationship among the families of irreducible ideals, strongly irreducible ideals, and prime ideals of a commutative ring R is considered, and a characterization is given of the Noetherian rings which contain a non-prime strongly irreducible ideal.     

Regularity of path ideals of gap free graphs

In this paper we study the Castelnuovo–Mumford regularity of the path ideals of finite simple graphs. We find new upper bounds for various path ideals of gap free graphs. In particular we prove that the t-path ideals of gap free, claw free and whiskered-$K_4$ free graphs have linear minimal free resolutions for all $t\ge 3$.     

Generalized cover ideals and the persistence property

Let I   be a square-free monomial ideal in R=k[_x1,…,_xn]$R=k[x_1,\dots ,x_n]$, and consider the sets of associated primes Ass(I^s)$\mathrm{Ass}(I^s)$ for all integers s?1$s?1$. Although it is known that the sets of associated primes of powers of I eventually stabilize, there are few results about the power at which this stabilization occurs (known as the index of stability). We introduce a family of square-free monomial ideals that can be associated to a finite simple graph G that generalizes the cover ideal construction. When G   is a tree, we explicitly determine Ass(I^s)$\mathrm{Ass}(I^s)$ for all s?1$s?1$. As consequences, not only can we compute the index of stability, we can also show that this family of ideals has the persistence property.     

Algebraic properties of classes of path ideals of posets

We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen–Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise in algebraic statistics from the Luce-decomposable model and the ascending model, can be viewed as path ideals of certain posets. We study invariants of these so-called Luce-decomposable monomial ideals and ascending ideals for diamond posets and products of chains. In particular, for these classes of posets, we explicitly compute their Krull dimension, their projective dimension, their Castelnuovo–Mumford regularity and their Betti numbers.     

A class of square-free monomial ideals associated to two integer sequences

Given two finite sequences of positive integers α and β, we associate a square-free monomial ideal I_α,β in a ring of polynomials S, and we recursively compute the algebraic invariants of S∕I_α,β. Also, we give precise formulas in special cases.     

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.     

Central Delannoy Numbers and Balanced Cohen-Macaulay Complexes

We introduce a new join operation on colored simplicial complexes that preserves the Cohen-Macaulay property. An example of this operation puts the connection between the central Delannoy numbers and Legendre polynomials in a wider context. On leave from the Rényi Mathematical Institute of the Hungarian Academy of Sciences. Received April 18, 2005     

Depths and Cohen–Macaulay properties of path ideals

Given a tree T on n vertices, there is an associated ideal I   of R[_x1,…,_xn]$R[x_1,\dots ,x_n]$ generated by all paths of a fixed length ? of T  . We classify all trees for which R/I$R/I$ is Cohen–Macaulay, and we show that an ideal I whose generators correspond to any collection of subtrees of T satisfies the König property. Since the edge ideal of a simplicial tree has this form, this generalizes a result of Faridi. Moreover, every square-free monomial ideal can be represented (non-uniquely) as a subtree ideal of a graph, so this construction provides a new combinatorial tool for studying square-free monomial ideals.     

A sequential equality constrained quadratic programming algorithm for inequality constrained optimization

In this paper, the feasible type SQP method is improved. A new SQP algorithm is presented to solve the nonlinear inequality constrained optimization. As compared with the existing SQP methods, per single iteration, in order to obtain the search direction, it is only necessary to solve equality constrained quadratic programming subproblems and systems of linear equations. Under some suitable conditions, the global and superlinear convergence can be induced.     

On the symmetry function of a convex set

We attempt a broad exploration of properties and connections between the symmetry function of a convex set S ${S \subset\mathbb{R}^n}We attempt a broad exploration of properties and connections between the symmetry function of a convex set S and other arenas of convexity including convex functions, convex geometry, probability theory on convex sets, and computational complexity. Given a point , let sym(x,S) denote the symmetry value of x in S: , which essentially measures how symmetric S is about the point x, and define x ^* is called a symmetry point of S if x ^* achieves the above maximum. The set S is a symmetric set if sym (S)=1. There are many important properties of symmetric convex sets; herein we explore how these properties extend as a function of sym (S) and/or sym (x,S). By accounting for the role of the symmetry function, we reduce the dependence of many mathematical results on the strong assumption that S is symmetric, and we are able to capture and otherwise quantify many of the ways that the symmetry function influences properties of convex sets and functions. The results in this paper include functional properties of sym (x,S), relations with several convex geometry quantities such as volume, distance, and cross-ratio distance, as well as set approximation results, including a refinement of the L?wner-John rounding theorems, and applications of symmetry to probability theory on convex sets. We provide a characterization of symmetry points x ^* for general convex sets. Finally, in the polyhedral case, we show how to efficiently compute sym(S) and a symmetry point x ^* using linear programming. The paper also contains discussions of open questions as well as unproved conjectures regarding the symmetry function and its connection to other areas of convexity theory. Dedicated to Clovis Gonzaga on the occasion of his 60th birthday.     

Chains of prime ideals in tensor products of algebras

This paper investigates the length of particular chains of prime ideals in tensor products of algebras over a field k. As an application, we compute dim(A⊗_kA) for a new family of domains A that are k-algebras.