Related papers: Minimal Cellular Resolutions of Path Ideals
Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…
This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…
In this paper we propose a model for computing a minimal free resolution for ideals of the form $I_{1}(X_{n}Y_{n})$, where $X_{n}$ is an $n\times n$ skew-symmetric matrix with indeterminate entries $x_{ij}$ and $Y_{n}$ is a generic column…
We find a minimal generating set for the De Concini-Procesi ideals indexed by hooks, and study their minimal free resolutions as well as their Hilbert series and regularity.
Squarefree powers of edge ideals are intimately related to matchings of the underlying graph. In this paper we give bounds for the regularity of squarefree powers of edge ideals, and we consider the question of when such powers are linearly…
Cellular resolutions is a well studied topic on the level of single resolutions and certain specific families of cellular resolutions. One question coming out of the work on families is to understand the structure of cellular resolutions…
We study various ideals arising in the theory of system reliability. We use ideas from the theory of divisors, orientations and matroids on graphs to describe the minimal polyhedral cellular free resolutions of these ideals. In each case we…
The Minimum Path Cover (MPC) problem consists of finding a minimum-cardinality set of node-disjoint paths that cover all nodes in a given graph. We explore a variant of the MPC problem on acyclic digraphs (DAGs) where, given a subset of…
We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular,…
For a finite simple graph $G$ and an integer $r \ge 1$, the $r$-connected ideal $I_r(G)$ is the squarefree monomial ideal generated by the vertex sets of connected induced subgraphs of size $r+1$, extending the classical edge ideal. We…
Fr\"oberg's classical theorem about edge ideals with $2$-linear resolution can be regarded as a classification of graphs whose edge ideals have linearity defect zero. Extending his theorem, we classify all graphs whose edge ideals have…
Let $J_{n,m} = (x_1\cdots x_{m},x_2 \cdots x_{m+1},\ldots,x_{n}x_1\cdots x_{m-1})$ be the $m$-path ideal of a cycle of length $n \ge 5$ over a polynomial ring $S = k[x_1,\ldots,x_n]$. Let $t\geq 1$ be an integer. We show that $J_{n,m}^t$…
We prove that, for the edge ideal of a cactus graph, the arithmetical rank is bounded above by the sum of the number of cycles and the maximum height of its associated primes. The bound is sharp, but in many cases it can be improved.…
We show that for the edge ideals of the graphs consisting of one cycle or two cycles of any length connected through a vertex or a path, the arithmetical rank equals the projective dimension.
We introduce the notion of a \emph{resolution supported on a poset}. When the poset is a CW-poset, i.e. the face poset of a regular CW-complex, we recover the notion of cellular resolution as introduced by Bayer and Sturmfels. Work of…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…
We introduce and study minimal (with respect to inclusion) solutions of systems of tropical linear differential equations. We describe the set of all minimal solutions for a single equation. It is shown that any tropical linear differential…
Circuits play a fundamental role in the theory of linear programming due to their intimate connection to algorithms of combinatorial optimization and the efficiency of the simplex method. We are interested in better understanding the…
In this paper we consider graded ideals in a polynomial ring over a field and ask when such an ideal has the property that all of its powers have a linear resolution. In particular it is shown that all powers of a monomial ideal with…