Table of Contents
Fetching ...

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

Jennifer Biermann, Trung Chau, Selvi Kara, Augustine O'Keefe, Joseph Skelton, Gabriel Sosa Castillo, Dalena Vien

Abstract

Let $G$ be a finite simple graph on $n$ vertices and set $R=\Bbbk[x_1,\dots,x_n]$, 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 $\textrm{deg } h_{R/I(G)}(t)$ and $\textrm{deg } h_{R/J(G)}(t)$ in terms of the independence polynomial $P_G(x)=\sum_{i\ge 0} g_i x^i$ via an invariant $M(G)$, the multiplicity of $x=-1$ as a root of $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)$ is the independence number of $G$. As a corollary, $M(G)$ is the additive inverse of the $\mathfrak{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 $\left|\textrm{reg }(R/J(G))-\textrm{deg } h_{R/J(G)}(t)\right|$ for connected graphs.

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

Abstract

Let be a finite simple graph on vertices and set , with edge ideal and cover ideal . We give an explicit description of the -polynomial of , in a form that extends to the Alexander dual of any squarefree monomial ideal. We then express and in terms of the independence polynomial via an invariant , the multiplicity of as a root of . In particular, we prove where is the independence number of . As a corollary, is the additive inverse of the -invariants of and . We develop recursions and closed formulas for 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 for connected graphs.
Paper Structure (16 sections, 43 theorems, 228 equations, 6 figures)

This paper contains 16 sections, 43 theorems, 228 equations, 6 figures.

Key Result

Theorem 2.1

Let $G$ be a chordal graph. Then where $i(G)$ is the independent domination number of $G$.

Figures (6)

  • Figure 1: A tree of radius at most $2$ with parameters as in \ref{['not:radius2']}.
  • Figure 2: All possible $(\mathop{\mathrm{reg}}\nolimits,\deg h)$ values for connected graphs on $n=9$ vertices. Filled points are realized by radius--$\leq 2$ trees; hollow points are not.
  • Figure 3: All possible $(\mathop{\mathrm{reg}}\nolimits,\deg h)$ values for connected graphs on $n=9$ vertices. Filled points are realized by split graphs and radius--$\leq 2$ trees; hollow points are not.
  • Figure 4: $B_k$ for $k=1,2,3$ from Construction \ref{['cons:Bk']} from left to right
  • Figure 5: The graph $G_{2,2}$ from Construction \ref{['cons:Gkr']}: the cone over $B_2\sqcup K_{1,2}$
  • ...and 1 more figures

Theorems & Definitions (114)

  • Definition 1
  • Definition 2
  • Remark 1
  • Definition 3
  • Remark 2
  • Theorem 2.1
  • Definition 4
  • Definition 5
  • Definition 6
  • Remark 3
  • ...and 104 more