Metraipolis › archive › dc_700d5c8e2b41

From Block Orthogonality to Decidability in Complex-Weighted Counting CSP — arXiv:2608.14845

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.14845
License (as archived)
CC0-1.0
Archived
2026-10-19T00:29:36.253Z
SHA-256 of the archived text
d0c02992dbea007f41a20aa0057b76a5b59fef78acbeeca8215ce5a1389affc9
Stable URL of this page
https://metraipolis.com/documento/dc_700d5c8e2b41

How to cite

From Block Orthogonality to Decidability in Complex-Weighted Counting CSP — arXiv:2608.14845 — arXiv (en), https://arxiv.org/abs/2608.14845 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_700d5c8e2b41 (Metraipolis archive dc_700d5c8e2b41, sha256 d0c02992dbea007f41a20aa0057b76a5b59fef78acbeeca8215ce5a1389affc9)
BibTeX
@misc{dc700d5c8e2b41,
  title = {From Block Orthogonality to Decidability in Complex-Weighted Counting CSP — arXiv:2608.14845},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.14845},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_700d5c8e2b41; sha256 d0c02992dbea007f41a20aa0057b76a5b59fef78acbeeca8215ce5a1389affc9},
  year = {2026}
}

Archived text

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

In a landmark JACM paper recognized with the 2021 G{ö}del Prize, Cai and Chen established a complete complexity dichotomy for counting CSPs over arbitrary finite domains with algebraic complex weights. Its polynomial-time side is characterized by three conditions---Block Orthogonality, Type Partition, and preservation by a common Mal'tsev operation---quantified over the countably infinite family $W_{\mathcal{F}}$ generated from arbitrary $\#\mathrm{CSP}(\mathcal{F})$ instances by partial summation. They asked whether these infinitary conditions are decidable from the finite language $\mathcal{F}$ alone---equivalently, whether the polynomial-time side of this complete fixed-language classification is uniformly recognizable. We settle this problem by giving, for every nonempty finite domain $D$ and every finite exactly encoded algebraic-complex language $\mathcal{F}$, a total exact algorithm that decides all three conditions on the full unbounded family $W_{\mathcal{F}}$. Beyond decidability, we prove that Block Orthogonality alone forces both Type Partition and the existence of a single Mal'tsev operation preserving all generated support and row-equivalence relations. Thus the three-condition characterization collapses to Block Orthogonality, and the finite input $(D,\mathcal{F})$ determines which side of the dichotomy applies. The same framework decides the corresponding conditions in the dichotomy theorem for degree-multiple counting CSP proved by Lin.

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