相关论文: Regularity and h-polynomials of toric ideals of gr…

Let $G$ be a finite simple graph and $I(G)$ denote the corresponding edge ideal. In this paper we prove that if $G$ is a very well-covered graph then for all $s \geq 2$ the regularity of $I(G)^s$ is exactly $2s+\nu(G)-1$.

We study monomial cut ideals associated to a graph $G$, which are a monomial analogue of toric cut ideals as introduced by Sturmfels and Sullivant. Primary decompositions, projective dimensions, and Castelnuovo-Mumford regularities are…

Let $G$ be the circulant graph $C_n(S)$ with $S\subseteq\{ 1,\ldots,\left \lfloor\frac{n}{2}\right \rfloor\}$ and let $I(G)$ be its edge ideal in the ring $K[x_0,\ldots,x_{n-1}]$. Under the hypothesis that $n$ is prime we : 1) compute the…

We show that the Castelnuovo-Mumford regularity of the binomial edge ideal of a graph is bounded below by the length of its longest induced path and bounded above by the number of its vertices.

In this article, we obtain an upper bound for the Castelnuovo-Mumford regularity of powers of an ideal generated by a homogeneous quadratic sequence in a polynomial ring in terms of the regularity of its related ideals and degrees of its…

The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…

Let $G=(V,E)$ be a finite simple graph. In this paper, we study the degree of the $h$-polynomial of the edge ideal of $G$ in relation to the independence number of $G$. Our approach is based on the value of the independence polynomial of…

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…

In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…

In this paper, we discuss the normality of the toric rings of stable set polytopes, and the set of generators and Gr\"obner bases of toric ideals of stable set polytopes by using the results on that of edge polytopes of finite nonsimple…

Let $I\subseteq R=\kk[x_1,...,x_n]$ be a homogeneous equigenerated ideal of degree $r$. We show here that the shapes of the Betti tables of the ideals $I^d$ stabilize, in the sense that there exists some $D$ such that for all $d\geq D$,…

Let $G$ be a graph consisting of $s$ odd cycles that all share a common vertex. Bhaskara, Higashitani, and Shibu Deepthi recently computed the $h$-polynomial for the quotient ring $R/I_G$, where $I_G$ is the toric ideal of $G$, in terms of…

Let $G$ be a finite connected simple graph and $I_{G}$ the toric ideal of the edge ring $K[G]$ of $G$. In the present paper, we study finite graphs $G$ with the property that $I_{G}$ is generated by quadratic binomials and $I_{G}$ possesses…

Let $I$ be any square-free monomial ideal, and $\mathcal{H}_I$ denote the hypergraph associated with $I$. Refining the concept of $k$-admissible matching of a graph defined by Erey and Hibi, we introduce the notion of generalized…

Let $I(G)$ be the edge ideal of a bicyclic graph. In this paper, we characterize the Castelnuovo-Mumford regularity of $I(G)$ in terms of the induced matching number of $G$. For the base case of this family of graphs, i.e. dumbbell graph,…

Let $G$ be a simple graph on the vertex set $\{v_{1},\ldots,v_{n}\}$. An algebraic object attached to $G$ is the toric ideal $I_G$. We say that $I_G$ is subgraph splittable if there exist subgraphs $G_1$ and $G_2$ of $G$ such that…

Let $G = (V,E)$ be a simple graph. We investigate the Cohen-Macaulayness and algebraic invariants, such as the Castelnuovo-Mumford regularity and the projective dimension, of the toric ring $k[G]$ via those of toric rings associated to…

A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…

We give a lower bound for the Castelnuovo-Mumford regularity of binomial edge ideals of block graphs by computing the two distinguished extremal Betti numbers of a new family of block graphs, called flower graphs. Moreover, we present a…

We study the homological algebra of edge ideals of Erd\"{o}s-R\'enyi random graphs. These random graphs are generated by deleting edges of a complete graph on $n$ vertices independently of each other with probability $1-p$. We focus on some…