Abstract

Let GG be a finite graph on the vertex set [d]={1,...,d}[d] = \{1, ..., d \} with the edges e1,...,ene_1, ..., e_n and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in dd variables over a field KK. The edge ring of GG is the semigroup ring K[G]K[G] which is generated by those monomials $\tb^e = t_it_j$ such that e={i,j}e = \{i, j\} is an edge of GG. Let $K[\xb] = K[x_1, ..., x_n]$ be the polynomial ring in nn variables over KK and define the surjective homomorphism $π: K[\xb] \to K[G]$ by setting $π(x_i) = \tb^{e_i}$ for i=1,...,ni = 1, ..., n. The toric ideal IGI_G of GG is the kernel of ππ. It will be proved that, given integers ff and dd with 6≤f≤d6 \leq f \leq d, there exist a finite connected nonbipartite graph GG on [d][d] together with a reverse lexicographic order $<_{\rev}$ on $K[\xb]$ and a lexicographic order $<_{\lex}$ on $K[\xb]$ such that (i) K[G]K[G] is normal, (ii) $\depth K[\xb]/\ini_{<_{\rev}}(I_G) = f$ and (iii) $K[\xb]/\ini_{<_{\lex}}(I_G)$ is Cohen--Macaulay, where $\ini_{<_{\rev}}(I_G)$ (resp.\ $\ini_{<_{\lex}}(I_G)$) is the initial ideal of IGI_G with respect to $<_{\rev}$ (resp.\ $<_{\lex}$) and where $\depth K[\xb]/\ini_{<_{\rev}}(I_G)$ is the depth of $K[\xb]/\ini_{<_{\rev}}(I_G)$.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.