Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 10 Feb 2026 in math.AC and math.CO | (2602.10376v1)

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)=i0gix<sup>iP_G(x)=\sum_{i\ge 0} g_i x<sup>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 [\textrm{deg } h_{R/I(G)}(t)=α(G)-M(G) \qquad\text{and}\qquad \textrm{deg } h_{R/J(G)}(t)=n-2-M(G), ] where α(G)α(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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.