English

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

Commutative Algebra 2026-02-12 v1 Combinatorics

Abstract

Let GG be a finite simple graph on nn vertices and set R=k[x1,,xn]R=\Bbbk[x_1,\dots,x_n], with edge ideal I(G)I(G) and cover ideal J(G)J(G). We give an explicit description of the hh-polynomial of R/J(G)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)\textrm{deg } h_{R/I(G)}(t) and deg hR/J(G)(t)\textrm{deg } h_{R/J(G)}(t) in terms of the independence polynomial PG(x)=i0gixiP_G(x)=\sum_{i\ge 0} g_i x^i via an invariant M(G)M(G), the multiplicity of x=1x=-1 as a root of PG(x)P_G(x). In particular, we prove deg hR/I(G)(t)=α(G)M(G)anddeg hR/J(G)(t)=n2M(G),\textrm{deg } h_{R/I(G)}(t)=\alpha(G)-M(G) \qquad\text{and}\qquad \textrm{deg } h_{R/J(G)}(t)=n-2-M(G), where α(G)\alpha(G) is the independence number of GG. As a corollary, M(G)M(G) is the additive inverse of the a\mathfrak{a}-invariants of R/I(G)R/I(G) and R/J(G)R/J(G). We develop recursions and closed formulas for M(G)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)\left|\textrm{reg }(R/J(G))-\textrm{deg } h_{R/J(G)}(t)\right| for connected graphs.

Keywords

Cite

@article{arxiv.2602.10376,
  title  = {Realizable (reg, deg h)-Pairs for Cover Ideals via Independence Polynomials},
  author = {Jennifer Biermann and Trung Chau and Selvi Kara and Augustine O'Keefe and Joseph Skelton and Gabriel Sosa Castillo and Dalena Vien},
  journal= {arXiv preprint arXiv:2602.10376},
  year   = {2026}
}

Comments

36 pages, 6 figures