Related papers: Stanley depth and simplicial spanning trees

Stanley showed that monomial complete intersections have the strong Lefschetz property. Extending this result we show that a simple extension of an Artinian Gorenstein algebra with the strong Lefschetz property has again the strong…

We study (slope-)stability properties of syzygy bundles on a projective space P^N given by ideal generators of a homogeneous primary ideal. In particular we give a combinatorial criterion for a monomial ideal to have a semistable syzygy…

In the laminar-constrained spanning tree problem, the goal is to find a minimum-cost spanning tree which respects upper bounds on the number of times each cut in a given laminar family is crossed. This generalizes the well-studied…

Powers of (monomial) ideals is a subject that still calls attraction in various ways. Let $I\subset \mathbb K[x_1,\ldots,x_n]$ be a monomial ideal and let $G(I)$ denote the (unique) minimal monomial generating set of $I$. How small can…

Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.

For a simplicial complex $\Delta$, we introduce a simplicial complex attached to $\Delta$, called the expansion of $\Delta$, which is a natural generalization of the notion of expansion in graph theory. We are interested in knowing how the…

We prove the subadditivity property for the maximal degrees of the syzygies of facet ideals simplicial forests. For such an ideal $I$, if the $i$-th Betti number is nonzero and $i=a+b$, we show that there are monomials in the lcm lattice of…

Let $M$ be an ideal in $K[x_1,...,x_n]$ ($K$ is a field) generated by products of linear forms and containing a homogeneous regular sequence of some length. We prove that ideals containing $M$ satisfy the Eisenbud-Green-Harris conjecture…

We investigate some combinatorial properties of convex polytopes simple in edges. For polytopes whose nonsimple vertices are located sufficiently far one from another, we prove an analog of the Hard Lefschetz theorem. It implies Stanley's…

We study the symbolic powers of the Stanley-Reisner ideal $I_{B_n}$ of a bipyramid $B_n$ over a $n-$gon $Q_n$. Using a combinatorial approach, based on analysis of subtrees in $Q_n$ we compute the Waldschmidt constant of $I_{B_n}$.

We consider the polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less…

We produce a highly structured way of associating a simplicial category to a model category which improves on work of Dwyer and Kan and answers a question of Hovey. We show that model categories satisfying a certain axiom are Quillen…

We prove the existence conjecture for combinatorial designs, answering a question of Steiner from 1853. More generally, we show that the natural divisibility conditions are sufficient for clique decompositions of simplicial complexes that…

Let $K$ be a field, $V$ a $K$-vector space with basis $e_1,\ldots,e_n$, and $E$ the exterior algebra of $V$. To a given monomial ideal $I\subsetneq E$ we associate a special monomial ideal $J$ with generators in the same degrees as those of…

Let $G$ be a graph with $n$ vertices and let $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over a field $\mathbb{K}$. Assume that $J(G)$ is the cover ideal of $G$ and $J(G)^{(k)}$ is its $k$-th symbolic power. We…

Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial…

We present an algorithm to decide whether or not a finitely generated subgroup of the isometry group of a locally finite simplicial tree is both discrete and free. The correctness of this algorithm relies on the following conjecture: every…

The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…

We introduce the concept of strong persistence and show that it implies persistence regarding the associated prime ideals of the powers of an ideal. We also show that strong persistence is equivalent to a condition on power of ideals…

We investigate the rational powers of ideals. We find that in the case of monomial ideals, the canonical indexing leads to a characterization of the rational powers yielding that symbolic powers of squarefree monomial ideals are indeed…