Related papers: Sortable Freiman ideals
In this paper, we study toric ideals associated with multichains of posets. It is shown that the comparability graph of a poset is chordal if and only if there exists a quadratic Gr\"obner basis of the toric ideal of the poset. Strong…
An equigenerated monomial ideal $I$ in the polynomial ring $S= K[x_1,\ldots,x_n]$ is a Freiman ideal if $\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $\mu(I)$ is the number of minimal…
We introduce the notion of sortability and $t$-sortability for a simplicial complex and study the graphs for which their independence complexes are either sortable or $t$-sortable. We show that the proper interval graphs are precisely the…
An equigenerated monomial ideal $I$ is a Freiman ideal if $\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $\mu(I)$ is the least number of monomial generators of $I$. Freiman ideals are special…
We show that the regularity of monomial ideals whose associated prime ideals are totally ordered by inclusion is linearly bounded.
In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…
An equigenerated monomial ideal $I$ in the polynomial ring $R=k[z_1,\ldots, z_n]$ is a Freiman ideal if $\mu(I^2)=\ell(I)\mu(I)-{\ell(I)\choose 2}$ where $\ell(I)$ is the analytic spread of $I$ and $\mu(I)$ is the number of minimal…
In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all…
In this paper, we study the componentwise linearity of edge ideals of weighted oriented graphs. We show that if $D$ is a weighted oriented graph whose edge ideal $I(D)$ is componentwise linear, then the underlying simple graph $G$ of $D$ is…
In this paper we study the Freiman inequality for the minimal number of generators of the square of an equigenerated monomial ideal. Such an ideal is called a Freiman ideal if equality holds in the Freiman inequality. We classify all…
Given a vertex-weighted oriented graph, we can associate to it a set of monomials. We consider the toric ideal whose defining map is given by these monomials. We find a generating set for the toric ideal for certain classes of graphs which…
We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…
We classify connected graphs $G$ whose binomial edge ideal is Gorenstein. The proof uses methods in prime characteristic.
It is shown that if the binomial edge ideal of a graph $G$ defines a Koszul algebra, then $G$ must be chordal and claw free. A converse of this statement is proved for a class of chordal and claw free graphs.
Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…
Herzog, Hibi, and Zheng classified the Cohen-Macaulay edge ideals of chordal graphs. In this paper, we classify Cohen-Macaulay edge ideals of (vertex) weighted oriented chordal and simplicial graphs, a more general class of monomial ideals.…
Let $G$ be a simple finite graph. A famous theorem of Dirac says that $G$ is chordal if and only if $G$ admits a perfect elimination order. It is known by Fr\"oberg that the edge ideal $I(G)$ of $G$ has a linear resolution if and only if…
For a monomial ideal $I$, we consider the $i$th homological shift ideal of $I$, denoted by $\text{HS}_i(I)$, that is, the ideal generated by the $i$th multigraded shifts of $I$. Some algebraic properties of this ideal are studied. It is…
An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to signed graphs,…
We will study monomial ideals $I$ in the exterior algebra as well as in the polynomial ring whose generic initial ideal is constant for all term orders up to permutations of variables. First, in the exterior algebra, we determine all graphs…