Related papers: Vanishing ideals over graphs and even cycles

The problem of determining the maximum number of maximal independent sets in certain graph classes dates back to a paper of Miller and Muller and a question of Erd\H{o}s and Moser from the 1960s. The minimum was always considered to be less…

The regularity of an edge ideal of a finite simple graph $G$ is at least the induced matching number of $G$ and is at most the minimum matching number of $G$. If $G$ possesses a dominating inuduced matching, i.e., an induced matching which…

Two directed graphs are called covariance equivalent if they induce the same set of covariance matrices, up to a Lebesgue measure zero set, on the random variables of their associated linear structural equation models. For acyclic graphs,…

Let K be a finite field and let X* be an affine algebraic toric set parameterized by monomials. We give an algebraic method, using Groebner bases, to compute the length and the dimension of C_X*(d), the parameterized affine code of degree d…

We give an explicit way of writing down a minimal set of generators for the canonical ideal of a non-degenerate curve, or of a more general smooth projective curve in a toric surface, in terms of its defining Laurent polynomial.

Hibi conjectured that if a toric ideal has a quadratic Gr\"obner basis, then the toric ideal has either a lexicographic or a reverse lexicographic quadratic Gr\"obner basis. In this paper, we present a cut ideal of a graph that serves as a…

For all integers $4 \leq r \leq d$, we show that there exists a finite simple graph $G= G_{r,d}$ with toric ideal $I_G \subset R$ such that $R/I_G$ has (Castelnuovo-Mumford) regularity $r$ and $h$-polynomial of degree $d$. To achieve this…

We give an explicit set of generators for the semigroup of the Gr\"obner degeneration of a toric ideal. This set of generators is used to study algebraic properties of the semigroup it generates: approximation of semigroups,…

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

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).

The geometric vertex decomposability property for polynomial ideals is an ideal-theoretic generalization of the vertex decomposability property for simplicial complexes. Indeed, a homogeneous geometrically vertex decomposable ideal is…

In this paper we prove the existence of a special order on the set of minimal monomial generators of powers of edge ideals of arbitrary graphs. Using this order we find new upper bounds on the regularity of powers of edge ideals of graphs…

With a simple graph $G$ on $[n]$, we associate a binomial ideal $P_G$ generated by diagonal minors of an $n \times n$ matrix $X=(x_{ij})$ of variables. We show that for any graph $G$, $P_G$ is a prime complete intersection ideal and…

An $X$-TAR (token addition/removal) reconfiguration graph has as its vertices sets that satisfy some property $X$, with an edge between two sets if one is obtained from the other by adding or removing one element. This paper considers the…

Let C be an irreducible projective curve of degree d in Pn(K), where K is an algebraically closed field, and let I be the associated homogeneous prime ideal. We wish to compute generators for I, assuming we are given sufficiently many…

We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…

To any toric ideal $I_A$, encoded by an integer matrix $A$, we associate a matroid structure called {\em the bouquet graph} of $A$ and introduce another toric ideal called {\em the bouquet ideal} of $A$. We show how these objects capture…

We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a…

Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…

Let $I_G$ be the binomial edge ideal on the generic 2 x n - Hankel matrix associated with a closed graph $G$ on the vertex set [n]. We characterize the graphs $G$ for which $I_G$ has maximal regularity and is Gorenstein.