Metraipolis › archive › dc_b4223ca37708

The combinatorial Hopf algebra of signed graphs — arXiv:2609.03959

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03959
License (as archived)
CC0-1.0
Archived
2026-10-17T02:33:49.234Z
SHA-256 of the archived text
c64cfc6787ebb234639cf7441230c6b2eb222382cfe84f5faf6bf397ea368f9b
Stable URL of this page
https://metraipolis.com/documento/dc_b4223ca37708

How to cite

The combinatorial Hopf algebra of signed graphs — arXiv:2609.03959 — arXiv (en), https://arxiv.org/abs/2609.03959 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_b4223ca37708 (Metraipolis archive dc_b4223ca37708, sha256 c64cfc6787ebb234639cf7441230c6b2eb222382cfe84f5faf6bf397ea368f9b)
BibTeX
@misc{dcb4223ca37708,
  title = {The combinatorial Hopf algebra of signed graphs — arXiv:2609.03959},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03959},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_b4223ca37708; sha256 c64cfc6787ebb234639cf7441230c6b2eb222382cfe84f5faf6bf397ea368f9b},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03959. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

The theory of combinatorial Hopf algebras (CHA) is a powerful framework for studying algebraic invariants of combinatorial objects. For instance, Stanley's chromatic symmetric function and the chromatic polynomial arise naturally from the CHA of graphs. In this paper, we define a CHA of signed graphs in order to study, in the same spirit, invariants of signed graphs such as the signed chromatic polynomial. The key ingredient of our construction is a well-chosen character, from which the signed chromatic invariants are obtained. Via the antipode, we obtain new proofs of combinatorial reciprocity results for these invariants. Moreover, by deforming the character with an additional parameter, we incorporate bivariate invariants into this framework, both for classical and signed graphs. In the classical case, this technique recovers the Tutte polynomial.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in math.CO).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2609.03959 — 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-17T02:09:21.193Z dalla pagina https://arxiv.org/catchup/math.CO/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).