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.     

Dense graphs and edge reconstruction

By a well-known result of Nash-Williams if a graphG is not edge reconstructible, then for all ,|A||E(G)| mod 2 we have a permutation ofV(G) such thatE(G)E(G)=A. Here we construct infinitely many graphsG having this curious property and more than edges.Research (partially) supported by Hungarian National Foundation for Scientific Research Grant No.T016389.     

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

Disproof of a conjecture in graph reconstruction theory

In his thesis [3] B. D. Thatte conjectured that ifG=G ₁,G ₂,...G _n is a sequence of finitely many simple connected graphs (isomorphic graphs may occur in the sequence) with the same number of vertices and edges then their shuffled edge deck uniquely determines the graph sequence (up to a permutation). In this paper we prove that there are such sequences of graphs with the same shuffled edge deck.This research was partially supported by Hungarian National Foundation of Scientific Research Grant no. 1812     

Embedded associated primes of powers of square-free monomial ideals

An ideal I in a Noetherian ring R is normally torsion-free if Ass(R/I^t)=Ass(R/I) for all t≥1. We develop a technique to inductively study normally torsion-free square-free monomial ideals. In particular, we show that if a square-free monomial ideal I is minimally not normally torsion-free then the least power t such that I^t has embedded primes is bigger than β₁, where β₁ is the monomial grade of I, which is equal to the matching number of the hypergraph H(I) associated to I. If, in addition, I fails to have the packing property, then embedded primes of I^t do occur when t=β₁+1. As an application, we investigate how these results relate to a conjecture of Conforti and Cornuéjols.     

The colorful Helly theorem and colorful resolutions of ideals

We demonstrate that the topological Helly theorem and the algebraic Auslander-Buchsbaum theorem may be viewed as different versions of the same phenomenon. Using this correspondence we show how the colorful Helly theorem of I. Barany and its generalizations by G. Kalai and R. Meshulam translate to the algebraic side. Our main results are algebraic generalizations of these translations, which in particular give a syzygetic version of Helly’s theorem.     

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.     

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.     

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.     

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.     

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.     

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

Gröbner bases of ideals cogenerated by Pfaffians

We characterise the class of one-cogenerated Pfaffian ideals whose natural generators form a Gröbner basis with respect to any anti-diagonal term order. We describe their initial ideals as well as the associated simplicial complexes, which turn out to be shellable and thus Cohen-Macaulay. We also provide a formula for computing their multiplicity.     

On the conjecture of hajós

Hajós conjectured that everys-chromatic graph contains a subdivision ofK _s, the complete graph ons vertices. Catlin disproved this conjecture. We prove that almost all graphs are counter-examles in a very strong sense.     

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     

Characteristic-independence of Betti numbers of graph ideals

In this paper, we study the Betti numbers of Stanley-Reisner ideals generated in degree 2. We show that the first 6 Betti numbers do not depend on the characteristic of the ground field. We also show that, if the number of variables n is at most 10, all Betti numbers are independent of the ground field. For n=11, there exists precisely 4 examples in which the Betti numbers depend on the ground field. This is equivalent to the statement that the homology of flag complexes with at most 10 vertices is torsion free and that there exists precisely 4 non-isomorphic flag complexes with 11 vertices whose homology has torsion.In each of the 4 examples mentioned above the 8th Betti numbers depend on the ground field and so we conclude that the highest Betti number which is always independent of the ground field is either 6 or 7; if the former is true then we show that there must exist a graph with 12 vertices whose 7th Betti number depends on the ground field.     

On the critical ideals of graphs

We introduce some determinantal ideals of the generalized Laplacian matrix associated to a digraph G, that we call critical ideals of G. Critical ideals generalize the critical group and the characteristic polynomials of the adjacency and Laplacian matrices of a digraph. The main results of this article are the determination of some minimal generator sets and the reduced Gröbner basis for the critical ideals of the complete graphs, the cycles and the paths. Also, we establish a bound between the number of trivial critical ideals and the stability and clique numbers of a graph.     

Asymptotic limit law for the close approach of two trajectories in expanding maps of the circle

Summary Given two pointsx, yS ¹ randomly chosen independently by a mixing absolutely continuous invariant measure of a piecewise expanding and smooth mapf of the circle, we consider for each >0 the point process obtained by recording the timesn>0 such that |f ⁿ (x)–f ⁿ (y)|. With the further assumption that the density of is bounded away from zero, we show that when tends to zero the above point process scaled by –1 converges in law to a marked Poisson point process with constant parameter measure. This parameter measure is given explicity by an average on the rate of expansion off.Partially supported by FAPESP grant number 90/3918-5     

Stanley-Reisner rings and the radicals of lattice ideals

In this article we associate to every lattice ideal I_L,ρ⊂K[x₁,…,x_m] a cone σ and a simplicial complex Δ_σ with vertices the minimal generators of the Stanley-Reisner ideal of σ. We assign a simplicial subcomplex Δ_σ(F) of Δ_σ to every polynomial F. If F₁,…,F_s generate I_L,ρ or they generate rad(I_L,ρ) up to radical, then is a spanning subcomplex of Δ_σ. This result provides a lower bound for the minimal number of generators of I_L,ρ which improves the generalized Krull's principal ideal theorem for lattice ideals. But mainly it provides lower bounds for the binomial arithmetical rank and the A-homogeneous arithmetical rank of a lattice ideal. Finally, we show by a family of examples that the given bounds are sharp.