Parity-Dependent Real-Rootedness in Independence Polynomials of Generalized Petersen Graphs
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908751659794432 |
|---|---|
| author | Pandey, Rohan |
| author_facet | Pandey, Rohan |
| contents | We investigate the distribution of zeros of the independence polynomial ${\rm I}(G, x)$ for the family of Generalized Petersen graphs ${\rm GP}(n, k)$ in the complex plane. While the independence numbers and coefficients of these graphs have been studied, the global behavior of their roots remains largely unexplored. Using an exact transfer matrix algorithm parameterized by $k$, we compute ${\rm I}({\rm GP}(n,k), x)$ for $n$ up to $30$ and $k \in \{1, 2, 3, 4\}$. Our numerical analysis reveals a striking parity-based dichotomy: for odd $k$, the roots exhibit complex conjugate structures accumulating on closed curves, whereas for even $k$, the roots appear to be strictly real and negative. Motivated by this evidence, we conjecture that ${\rm I}({\rm GP}(n,k), x)$ is real-rooted, and hence log-concave, if and only if $k$ is even. This phenomenon connects algebraic properties of ${\rm GP}(n,k)$ to questions about zero-free regions and limiting behavior in the hard-core lattice gas model. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_03293 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Parity-Dependent Real-Rootedness in Independence Polynomials of Generalized Petersen Graphs Pandey, Rohan Combinatorics We investigate the distribution of zeros of the independence polynomial ${\rm I}(G, x)$ for the family of Generalized Petersen graphs ${\rm GP}(n, k)$ in the complex plane. While the independence numbers and coefficients of these graphs have been studied, the global behavior of their roots remains largely unexplored. Using an exact transfer matrix algorithm parameterized by $k$, we compute ${\rm I}({\rm GP}(n,k), x)$ for $n$ up to $30$ and $k \in \{1, 2, 3, 4\}$. Our numerical analysis reveals a striking parity-based dichotomy: for odd $k$, the roots exhibit complex conjugate structures accumulating on closed curves, whereas for even $k$, the roots appear to be strictly real and negative. Motivated by this evidence, we conjecture that ${\rm I}({\rm GP}(n,k), x)$ is real-rooted, and hence log-concave, if and only if $k$ is even. This phenomenon connects algebraic properties of ${\rm GP}(n,k)$ to questions about zero-free regions and limiting behavior in the hard-core lattice gas model. |
| title | Parity-Dependent Real-Rootedness in Independence Polynomials of Generalized Petersen Graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2601.03293 |