Related papers: A hypergraph characterization of nearly complete i…
A quasi-complete intersection (q.c.i.) ideal of a local ring is an ideal with "free exterior Koszul homology"; the definition can also be understood in terms of vanishing of Andr\'e-Quillen homology functors. Principal q.c.i. ideals are…
Binomial edge ideals IG of a graph G were introduced by [4]. They found some classes of graphs G with the property that IG is a Cohen-Macaulay ideal. This might happen only for few classes of graphs. A certain generalization of being…
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…
The classification of complete multipartite graphs whose edge rings are nearly Gorenstein as well as that of finite perfect graphs whose stable set rings are nearly Gorenstein is achieved.
In this paper we extend a result of Cowsik on set-theoretic complete intersection and a result Huneke, Morales and Goto and Nishida about Noetherian symbolic Rees algebras of ideals. As applications, we show that the symbolic Rees algebras…
If $J\subset I$ are two monomials ideals, we give a practical upper bound for the Stanley depth of $J/I$, which we call it the \emph{quasi-depth} of $J/I$. Also, we compute the quasi-depth of several classes of square free monomial ideals.…
We describe all connected graphs whose edge ideals are almost normally torsionfree. We also prove that the facet ideal of a special odd cycle is almost normally torsionfree. Finally, we determine the t-spread principal Borel ideals…
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 Hilbert polynomial of a homogeneous complete intersection is determined by the degrees of the generators of the defining ideal. The degrees of the generators are not, in general, determined by the Hilbert polynomial -- but sometimes…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
We introduce a class of ideals generated by a set of 2-minors of $m\times n$-matrix of indeterminates indexed by a pair of graphs. This class of ideals is a natural common generalization of binomial edge ideals and ideals generated by…
We provide a characterization of one-dimensional almost Gorenstein rings in terms of the trace ideal. As an application, we investigate the almost Gorenstein property of certain $\mathbb{Z}_2$-graded rings.
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…
The arithmetic rank of an ideal in a polynomial ring over an algebraically closed field is the smallest number of equations needed to define its vanishing locus set-theoretically. We determine the arithmetic rank of the generic $m$-residual…
We generalize some properties related to Hilbert series and Lefschetz properties of Milnor algebras of projective hypersurfaces with isolated singularities to the more general case of an almost complete intersection ideal $J$ of dimension…
In this paper we study minimal free resolutions of some classes of monomial ideals. we first give a sufficient condition to check the minimality of the resolution obtained by the mapping cone. Using it, we obtain the Betti numbers of…
We discuss the property of (almost) complete intersection of LSS-ideals of graphs of some special forms, like trees, unicyclic, and bicyclic graphs. Further, we give a sufficient condition for the complete intersection property of twisted…
Cut ideals, introduced by Sturmfels and Sullivant, are used in phylogenetics and algebraic statistics. We study the minimal free resolutions of cut ideals of tree graphs. By employing basic methods from topological combinatorics, we obtain…
In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…
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).