Related papers: Cartwright-Sturmfels ideals associated to graphs a…

The number of equations needed to cut out a variety given by an ideal is called the arithmetic rank (of the ideal). It was shown in [8] that the notion of arithmetic rank is strongly related to the concept of regular sequences on the Matlis…

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 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…

Using recent work by Erman-Sam-Snowden, we show that finitely generated ideals in the ring of bounded-degree formal power series in infinitely many variables have finitely generated Gr\"obner bases relative to the graded reverse…

There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…

We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.

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 study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of…

In this article we investigate when a homogeneous ideal in a graded ring is normal, that is, when all positive powers of the ideal are integrally closed. We are particularly interested in homogeneous ideals in an N-graded ring generated by…

We present a class of homogeneous ideals which are generated by monomials and binomials of degree two and are set-theoretic complete intersections. This class includes certain reducible varieties of minimal degree and, in particular, the…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

In this article, we give a comprehensive survey of the recent progress of research on binomial edge ideal of a graph since 2018.

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…

We prove a conjecture of the first author relating the Bernstein-Sato ideal of a finite collection of multivariate polynomials with cohomology support loci of rank one complex local systems. This generalizes a classical theorem of Malgrange…

Distance ideals generalize the Smith normal form of the distance matrix of a graph. The family of graphs with 2 trivial distance ideals contains the family of graphs whose distance matrix has at most 2 invariant factors equal to 1. Here we…

Let $R$ be a standard graded polynomial ring that is finitely generated over a field, and let $I$ be a homogenous prime ideal of $R$. Bhatt, Blickle, Lyubeznik, Singh, and Zhang examined the local cohomology of $R/I^t$, as $t$ grows…

Let $R=K[x_1,...,x_n]$ be the polynomial ring in $n$ variables over a field $K$ and $I$ be a monomial ideal generated in degree $d$. Bandari and Herzog conjectured that a monomial ideal $I$ is polymatroidal if and only if all its monomial…

Let $R=\mathbb{K}[X_1, \ldots , X_n ]$ be a polynomial ring over a field $\mathbb{K}$. We introduce an endomorphism $\mathcal{F}^{[m]}: R \rightarrow R $ and denote the image of an ideal $I$ of $R$ via this endomorphism as $I^{[m]}$ and…

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 $G$ be a simple graph with binomial edge ideal $J_G$. We prove how to calculate the multidegree of $J_G$ based on combinatorial properties of $G$. In particular, we study the set $S_{\min}(G)$ defined as the collection of subsets of…