Related papers: Almost complete intersection binomial edge ideals …

We provide a characterisation of all graphs whose parity binomial edge ideals have pure resolutions. In particular, we show that the minimal free resolution of a parity binomial edge ideal is pure if and only if the corresponding graph is a…

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…

In this short note, we confirm a conjecture of Vasconcelos which states that the Rees algebra of any Artinian almost complete intersection monomial ideal is almost Cohen-Macaulay.

An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…

In this paper we describe the defining equations of the Rees algebra and the special fiber ring of a truncation I of a complete intersection ideal in a polynomial ring over a field with homogeneous maximal ideal m. To describe explicitly…

Let $G$ be a finite simple graph on the vertex set $V(G) = \{x_1, \ldots, x_n\}$ and $I(G) \subset K[V(G)]$ its edge ideal, where $K[V(G)]$ is the polynomial ring in $x_1, \ldots, x_n$ over a field $K$ with each ${\rm deg} x_i = 1$ and…

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

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…

We prove that level binomial edge ideals with regularity 2 and pseudo-Gorenstein binomial edge ideals with regularity 3 are cones, and we describe them completely. Also, we characterize level and pseudo-Gorenstein binomial edge ideals of…

Let $G$ be a finite simple graph on the vertex set $V(G)$ and let $r$ be a positive integer. We consider the hypergraph $\mathrm{Con}_r(G)$ whose vertices are the vertices of $G$ and the (hyper)edges are all $A\subseteq V(G)$ such that…

Let $G$ be a finite connected simple graph, and let $\mathcal{J}_{K_m,G}$ denote its generalized binomial edge ideal. By investigating the colon ideals of $\mathcal{J}_{K_m,G}$, we derive a formula for the local $\mathrm{v}$-number of…

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…

We discuss algebraic and homological properties of binomial edge ideals associated to graphs which are obtained by gluing of subgraphs and the formation of cones.

Let $S={\sf k}[X_1,\dots, X_n]$ be a polynomial ring, where ${\sf k}$ is a field. This article deals with the defining ideal of the Rees algebra of squarefree monomial ideal generated in degree $n-2$. As a consequence, we prove that Betti…

We introduce and study vertex cover algebras of weighted simplicial complexes. These algebras are special classes of symbolic Rees algebras. We show that symbolic Rees algebras of monomial ideals are finitely generated and that such an…

We first characterise graphs with binomial edge ideals of K\"onig type as those for which the path covering number is equal to a minor variant of the scattering number. These are well-studied graph-theoretic invariants, allowing us to apply…

Let $G=(V,E)$ be a finite, simple graph. We consider for each oriented graph $G_{\cal O}$ associated to an orientation ${\cal O}$ of the edges of $G$, the toric ideal $P_{G_{\cal O}}$. In this paper we study those graphs with the property…

Consider the rational map $\phi: \mathbb{P}^{n-1}_{\mathbf k} \stackrel{[f_0:\cdots: f_n]}{\longrightarrow} \mathbb{P}^{n}_{\mathbf k}$ defined by homogeneous polynomials $f_0,\dots,f_n$ of the same degree $d$ in a polynomial ring…

The vertex cover ideal $J(G)$ of a finite graph $G$ is studied. We characterize when a Cohen--Macaulay vertex cover ideal $J(G)$ has a Scarf minimal free resolution. Furthermore, by using both combinatorial and topological techniques, the…