Metraipolis › archive › dc_af935fade6ff
Irreducibility of interlace polynomials — arXiv:2608.07847
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.07847
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:08:48.334Z
- SHA-256 of the archived text
8e7948c732e85fd70d5cf8265683818d669e7c40c62d8bdb7fb1817d3427b7a6- Stable URL of this page
https://metraipolis.com/documento/dc_af935fade6ff
How to cite
Irreducibility of interlace polynomials — arXiv:2608.07847 — arXiv (en), https://arxiv.org/abs/2608.07847 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_af935fade6ff (Metraipolis archive dc_af935fade6ff, sha256 8e7948c732e85fd70d5cf8265683818d669e7c40c62d8bdb7fb1817d3427b7a6)
BibTeX
@misc{dcaf935fade6ff,
title = {Irreducibility of interlace polynomials — arXiv:2608.07847},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.07847},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_af935fade6ff; sha256 8e7948c732e85fd70d5cf8265683818d669e7c40c62d8bdb7fb1817d3427b7a6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.07847. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The factorisation of graph polynomials often reflects combinatorial decomposition. For a nonempty loopless graph $G$, we first prove that the two-variable interlace polynomial $q(G;x,y)$, introduced by Arratia, Bollobás and Sorkin, is irreducible over $\mathbb{C}[x,y]$ if and only if $G$ is connected, exactly paralleling the classical irreducibility theorem for the Tutte polynomial. The loopless hypothesis is essential: we construct an infinite family of connected looped graphs whose two-variable interlace polynomials are reducible. For a nonempty graph $G$, we prove that Courcelle's multivariate interlace polynomial $C_G(u,v;\mathbf{x},\mathbf{y})$ is irreducible over $\mathbb{C}[u,v,x_a,y_a:a\in V(G)]$ if and only if $G$ is connected.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2608.07847 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:05:33.542Z dalla pagina https://arxiv.org/catchup/math.CO/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).