Gr\"obner basis and Krull dimension of Lov\'asz-Saks-Sherijver ideal associated to a tree

Abstract

Let K be a field and n be a positive integer. Let =([n], E) be a simple graph, where [n]=\1,…, n\. If S=K[x1, …, xn, y1, …, yn] is a polynomial ring, then the graded ideal \[ LK(2) = ( xixj + yiyj \i, j\ ∈ E()) ⊂ S,\] is called the Lov\'asz-Saks-Schrijver ideal, LSS-ideal for short, of with respect to K. In the present paper, we compute a Gr\"obner basis of this ideal with respect to lexicographic ordering induced by x1>·s>xn>y1>·s>yn when =T is a tree. As a result, we show that it is independent of the choice of the ground field K and compute the Hilbert series of LTK(2). Finally, we present concrete combinatorial formulas to obtain the Krull dimension of S/LTK(2) as well as lower and upper bounds for Krull dimension.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…