Metraipolis › archive › dc_2b277ff2a6c0
The Loopy Polynomial: from Tutte's Universal $V$-Function to Bizonotopal Geometry — arXiv:2609.07728
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.07728
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:48:49.411Z
- SHA-256 of the archived text
d29f0df4b575d6b678c07dd6498983e4c7205389e37e23be1fa6904c9545d597- Stable URL of this page
https://metraipolis.com/documento/dc_2b277ff2a6c0
How to cite
The Loopy Polynomial: from Tutte's Universal $V$-Function to Bizonotopal Geometry — arXiv:2609.07728 — arXiv (en), https://arxiv.org/abs/2609.07728 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2b277ff2a6c0 (Metraipolis archive dc_2b277ff2a6c0, sha256 d29f0df4b575d6b678c07dd6498983e4c7205389e37e23be1fa6904c9545d597)
BibTeX
@misc{dc2b277ff2a6c0,
title = {The Loopy Polynomial: from Tutte's Universal $V$-Function to Bizonotopal Geometry — arXiv:2609.07728},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.07728},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2b277ff2a6c0; sha256 d29f0df4b575d6b678c07dd6498983e4c7205389e37e23be1fa6904c9545d597},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.07728. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the loopy polynomial L_G, a multivariate graph invariant arising from bizonotopal graph algebras and defined by a deletion-loopy-contraction recursion, in which the contracted edge becomes a loop. We show that L_G contains the Tutte polynomial and admits a similar spanning-forest activity expansion. It also determines Stanley's chromatic symmetric function, the degree sequence, the induced edge count profile, and the independence polynomial for loopless graphs, and the clique and matching polynomials for simple graphs. Separating the size and the external activity of each forest component leads to a refined loopy polynomial, which we show to be equivalent to the extended U-polynomial of Noble and Welsh and to the extended polychromate. Different specializations of this common refinement give the ordinary U-polynomial, Tutte's universal V-function, and Stanley's Tutte symmetric function, placing these invariants into a single framework. We conjecture that L_G and the U-polynomial have the same distinguishing power on simple graphs, and verify this for all graphs on at most 11 vertices. Simplicity is essential: we found two loopless multigraphs with equal U-polynomials but distinct loopy polynomials. They also have distinct extended U-polynomials, so the ordinary U-polynomial does not determine the extended one on loopless multigraphs. This solves an open problem by Merino and Noble. For the score polytope P_G of the external bizonotopal algebra, loopy deletion-contraction lifts from the lattice-point enumerator to the polytope itself. This gives forest-indexed geometric parking complexes whose lattice points partition those of P_G, and which are piecewise-linearly parametrized by products of intervals whose lengths are the component weights in the forest expansion of L_G. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.CO). Categorie arXiv: Combinatorics (math.CO). Pagina del lavoro: https://arxiv.org/abs/2609.07728 — 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-16T14:32:29.827Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).