Metraipolis › archive › dc_d055d06a4232

Abelian embeddings make useful promises: approximation of detrivialised equations — arXiv:2611.04569

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04569
License (as archived)
CC0-1.0
Archived
2026-11-04T19:07:47.214Z
SHA-256 of the archived text
30e38b9681ce11159299fa69441ea5ae3b89749136279d162df2641e7713bf20
Stable URL of this page
https://metraipolis.com/documento/dc_d055d06a4232

How to cite

Abelian embeddings make useful promises: approximation of detrivialised equations — arXiv:2611.04569 — arXiv (en), https://arxiv.org/abs/2611.04569 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d055d06a4232 (Metraipolis archive dc_d055d06a4232, sha256 30e38b9681ce11159299fa69441ea5ae3b89749136279d162df2641e7713bf20)
BibTeX
@misc{dcd055d06a4232,
  title = {Abelian embeddings make useful promises: approximation of detrivialised equations — arXiv:2611.04569},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04569},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d055d06a4232; sha256 30e38b9681ce11159299fa69441ea5ae3b89749136279d162df2641e7713bf20},
  year = {2026}
}

Archived text

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

We study the following family of search problems: given a system of equations $x+y+z\equiv 0\pmod p$ promised to admit a solution that is nonconstant on every equation, find a $c$-colouring of the variables that makes no equation monochromatic. For $p\in\{2,3\}$, the problem recovers known tractable Promise Constraint Satisfaction Problems (PCSPs). For $p > 3$, we obtain a complete complexity classification: the problem is polynomial-time solvable for $c \geq 4$, yet even its decision version is NP-hard for $c = 3$, and it is not well-defined for $c = 2$. Our main conceptual contribution is a general tractability framework for PCSPs based on Abelian embeddings, a notion introduced by Bhangale, Khot, and Minzer [STOC 2022] in the study of quantitative approximation of satisfiable CSPs. We show that suitable Abelian embeddings yield polynomial-time PCSP reductions realised by singleton algorithms in the sense of Zhuk [FOCS 2026]. On the hardness side, the promise relation is far removed from the reconfigurable regime covered by the conditional hardness framework of Banakh, Barsukov, and Nakajima [LICS 2026]; our proof instead relies on a new additive-combinatorial rigidity theorem classifying special $3$-colourings of $\mathbb{Z}_p$.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv cs.DS, nuovi lavori del giorno).
Categorie arXiv: Computational Complexity (cs.CC) ; Discrete Mathematics (cs.DM); Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2611.04569 — 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-11-04T18:40:52.492Z dalla pagina https://arxiv.org/list/cs.DS/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).