相关论文: Linear strands of edge ideals of multipartite unif…

Toward a partial classification of monomial ideals with $d$-linear resolution, in this paper, some classes of $d$-uniform clutters which do not have linear resolution, but every proper subclutter of them has a $d$-linear resolution, are…

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

In this paper, we introduce the notion of binomial edge ideals of a clutter and obtain results similar to those obtained for graphs by Rauf \& Rinaldo in \cite{raufrin}. We also answer a question posed in their paper.

Let (P,<) be a finite poset and let G be its comparability graph. If cl(G) is the clutter of maximal cliques of G, we prove that cl(G) satisfies the max-flow min-cut property and that its edge ideal is normally torsion free. We prove that…

We explicitly describe cellular minimal free resolutions of certain classes of edge ideals of weighted complete bipartite graphs based on a construction of Visscher. Specifically, we show that Visscher's construction minimally resolves all…

Let C be a uniform clutter and let I=I(C) be its edge ideal. We prove that if C satisfies the packing property (resp. max-flow min-cut property), then there is a uniform Cohen-Macaulay clutter C1 satisfying the packing property (resp.…

We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…

A determinantal facet ideal (DFI) is an ideal $J_\Delta$ generated by maximal minors of a generic matrix parametrized by an associated simplicial complex $\Delta$. In this paper, we construct an explicit linear strand for the initial ideal…

This paper concerns the study of a class of clutters called simplicial subclutters. Given a clutter $\mathcal{C}$ and its simplicial subclutter $\mathcal{D}$, we compare some algebraic properties and invariants of the ideals $I, J$…

In this work we introduce a new set of invariants associated to the linear strands of a minimal free resolution of a $\mathbb{Z}$-graded ideal $I\subseteq R=\Bbbk[x_1, \ldots, x_n]$. We also prove that these invariants satisfy some…

Let $X$ be an $(m\times n)$-matrix of indeterminates, and let $J$ be the ideal generated by a set $\mathcal{S}$ of maximal minors of $X$. We construct the linear strand of the resolution of $J$. This linear strand is determined by the…

Let C be a clutter and let I(C) be its edge ideal. This is a survey paper on the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regularity of R/I(C) and apply this criterion to give…

We give upper bounds for the Stanley depth of edge ideals of certain k-partite clutters. In particular, we generalize a result of Ishaq about the Stanley depth of the edge ideal of a complete bipartite graph. A result of Pournaki, Seyed…

We focus in this paper on edge ideals associated to bipartite graphs and give a combinatorial characterization of those having regularity 3. When the regularity is strictly bigger than 3, we determine the first step $i$ in the minimal…

The aim of this work is to study the v-number of edge ideals of clutters and graphs. We relate the v-number with the regularity of edge ideals and study the combinatorial structure of the graphs whose edge ideals have their second symbolic…

We present an explicit construction of a minimal cellular resolution for the edge ideals of forests, based on discrete Morse theory. In particular, the generators of the free modules are subsets of the generators of the modules in the…

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

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…

We describe the Betti numbers of the edge ideals $I(G)$ of uniform hypergraphs $G$ such that $I(G)$ has linear graded free resolution. We give an algebraic equation system and some inequalities for the components of the $f$--vector of the…

Let C be a uniform clutter, i.e., all the edges of C have the same size, and let A be the incidence matrix of C. We denote the column vectors of A by v1,...,vq. The vertex covering number of C, denoted by g, is the smallest number of…