Metraipolis › archive › dc_e0ef2f69805a

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$ — arXiv:2609.11175

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11175
License (as archived)
CC0-1.0
Archived
2026-10-16T06:39:42.147Z
SHA-256 of the archived text
842a8c9ec9e980008209e72c8871c09f1d6663108f3a87f074b82c11cff1965b
Stable URL of this page
https://metraipolis.com/documento/dc_e0ef2f69805a

How to cite

The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,\mathbb{C})$ — arXiv:2609.11175 — arXiv (en), https://arxiv.org/abs/2609.11175 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e0ef2f69805a (Metraipolis archive dc_e0ef2f69805a, sha256 842a8c9ec9e980008209e72c8871c09f1d6663108f3a87f074b82c11cff1965b)
BibTeX
@misc{dce0ef2f69805a,
  title = {The Computational Complexity of Holant Problems on 4-regular Graphs from the Stable Subgroup Sequence of $SL(2,mathbbC)$ — arXiv:2609.11175},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11175},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e0ef2f69805a; sha256 842a8c9ec9e980008209e72c8871c09f1d6663108f3a87f074b82c11cff1965b},
  year = {2026}
}

Archived text

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

The Holant framework provides a general setting for studying counting problems and includes graph homomorphisms (\#GH) and counting constraint satisfaction problems (\#CSP) as special cases. Over the past twenty years, a series of computational complexity dichotomies have been established for Holant problems, but the classification for complex-valued signatures is still open. The main obstacle is the case in which all signatures have even arity. In this paper, we establish a dichotomy for Holant problems with a complex-valued 4-ary signature, which is a key base case for the full classification of Holant problems. We present a new strategy by introducing Schur's theorem, the classification of finite subgroups of $\mathrm{SL}(2,\mathbb{C})$ and stable subgroup sequences into the proof. These new techniques are of independent interest.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in cs.CC).
Categorie arXiv: Computational Complexity (cs.CC).
Pagina del lavoro: https://arxiv.org/abs/2609.11175 — 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-16T06:19:27.873Z dalla pagina https://arxiv.org/catchup/cs.CC/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).