Related papers: Chorded complexes and a necessary condition for a …
We identify several classes of monomial ideals that possess minimal generalized Barile-Macchia resolutions. These classes of ideals include generic monomial ideals, monomial ideals with linear quotients, and edge ideals of hypertrees. We…
We study monomial ideals with linear presentation or partially linear resolution. We give combinatorial characterizations of linear presentation for square-free ideals of degree 3, and for primary ideals whose resolutions are linear except…
For each squarefree monomial ideal $I\subset S = k[x_{1},\ldots, x_{n}] $, we associate a simple graph $G_I$ by using the first linear syzygies of $I$. In cases, where $G_I$ is a cycle or a tree, we show the following are equivalent: (a) $…
We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a…
We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…
We explore resolutions of monomial ideals supported by simplicial trees. We argue that since simplicial trees are acyclic, the criterion of Bayer, Peeva and Sturmfels for checking if a simplicial complex supports a free resolution of a…
We show that a monomial ideal $I$ has projective dimension $\leq$ 1 if and only if the minimal free resolution of $S/I$ is supported on a graph that is a tree. This is done by constructing specific graphs which support the resolution of the…
An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…
Each (equigenerated) squarefree monomial ideal in the polynomial ring $S=\mathbb{K}[x_1, \ldots, x_n]$ represents a family of subsets of $[n]$, called a (uniform) clutter. In this paper, we introduce a class of uniform clutters, called…
In this paper we study simplicial complexes as higher dimensional graphs in order to produce algebraic statements about their facet ideals. We introduce a large class of square-free monomial ideals with Cohen-Macaulay quotients, and a…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
In a recent work, Fouli and Lin generalized a Villarreal's result and showed that if each connected components of the line graph of a squarefree monomial ideal contains at most a unique odd cycle, then this ideal is of linear type. In this…
In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by S. Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the…
In this paper we introduce the notion of a $d$-dimensional cycle which is a homological generalization of the idea of a graph cycle to higher dimensions. We examine both the combinatorial and homological properties of this structure and use…
As a higher analogue of the edge ideal of a graph, we study the $t$-connected ideal $\operatorname{J}_{t}$. This is the monomial ideal generated by the connected subsets of size $t$. For chordal graphs, we show that $\operatorname{J}_{t}$…
Chordal clutters in the sense of [14] and [3] are defined via simplicial orders. Their circuit ideal has a linear resolution, independent of the characteristic of the base field. We show that any Betti sequence of an ideal with linear…
We prove that for all $d \geq 1$ a shellable $d$-dimensional simplicial complex with at most $d+3$ vertices is extendably shellable. The proof involves considering the structure of `exposed' edges in chordal graphs as well as a connection…
When a monomial ideal has linear quotients with respect to an admissible order of increasing support-degree, we provide two proofs of different flavors to show that it is componentwise support-linear. We also introduce the variable…
In this paper, we consider the generalization of chordal graphs to clutters proposed by Bigdeli, et al in J. Combin. Theory, Series A (2017). Assume that $\mathcal{C}$ is a $d$-dimensional uniform clutter. It is known that if $\mathcal{C}$…
We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…