Realizable (reg, deg h)-Pairs for Cover Ideals via Independence Polynomials

Abstract

Let G be a finite simple graph on n vertices and set R=[x1,…,xn], with edge ideal I(G) and cover ideal J(G). We give an explicit description of the h-polynomial of R/J(G), in a form that extends to the Alexander dual of any squarefree monomial ideal. We then express deg hR/I(G)(t) and deg hR/J(G)(t) in terms of the independence polynomial PG(x)=Σi 0 gi xi via an invariant M(G), the multiplicity of x=-1 as a root of PG(x). In particular, we prove \[deg hR/I(G)(t)=α(G)-M(G) deg hR/J(G)(t)=n-2-M(G), \] where α(G) is the independence number of G. As a corollary, M(G) is the additive inverse of the a-invariants of R/I(G) and R/J(G). We develop recursions and closed formulas for M(G) for broad graph families, and use them to analyze which (reg, deg h)-pairs occur for cover ideals within chordal classes, including explicit constructions realizing extremal behavior. We conclude with a conjectural bound on |reg (R/J(G))-deg hR/J(G)(t)| for connected graphs.

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…