Metraipolis › archive › dc_70142477cabb
Coordination three heals, coordination four is hard: the antiferromagnetic Potts model with a costly third state — arXiv:2610.41277
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41277
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-02T08:09:59.275Z
- SHA-256 of the archived text
efd40ca17a17ac36f083f41ed25f9e1a6ab5452eb3337659eefa3751285c1894- Stable URL of this page
https://metraipolis.com/documento/dc_70142477cabb
How to cite
Coordination three heals, coordination four is hard: the antiferromagnetic Potts model with a costly third state — arXiv:2610.41277 — arXiv (en), https://arxiv.org/abs/2610.41277 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_70142477cabb (Metraipolis archive dc_70142477cabb, sha256 efd40ca17a17ac36f083f41ed25f9e1a6ab5452eb3337659eefa3751285c1894)
BibTeX
@misc{dc70142477cabb,
title = {Coordination three heals, coordination four is hard: the antiferromagnetic Potts model with a costly third state — arXiv:2610.41277},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41277},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_70142477cabb; sha256 efd40ca17a17ac36f083f41ed25f9e1a6ab5452eb3337659eefa3751285c1894},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41277. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study the ground states of the antiferromagnetic three-state Potts model in which the third state carries a single-ion energy cost $D_3$, on arbitrary lattices, and show that the difficulty of the ground-state problem is controlled by the maximum coordination $\Delta$ alone; on planar lattices with $\Delta\le5$ it is classified completely. On lattices with coordination at most three the third state heals frustrated bonds one for one: every graph of maximum degree three other than $K_4$ has an independent set of sites that meets every odd cycle and whose size equals the number $\operatorname{fr}$ of frustrated bonds of the Ising ground state. This identity also follows from known results on the chromatic vertex stability of graphs; we give a constructive proof. Hence $E_0 (D_3)=\min(D_3,1) \operatorname{fr}$ for all $D_3$, computable in polynomial time on planar lattices. In graph-theoretic terms, independent odd cycle transversal is solvable in polynomial time on planar subcubic graphs. On planar lattices with maximum coordination four, in contrast, deciding the ground-state energy is NP-complete for every fixed $0\le D_3<2$ and polynomial for $D_3\ge2$. The boundary is set by a local principle: a site of coordination $d$ in the third state relieves at most $\lfloor d/2\rfloor$ frustrated bonds, so the third state is useless once $D_3\ge\lfloor\Delta/2\rfloor$; this threshold is sharp for every $\Delta\ge3$ and reproduces the triangular-lattice point $D_3^*=3$ of the equivalent spin-1 Blume--Capel antiferromagnet. From a single Ising ground state the proof builds an exact ground state in polynomial time, which for quasicrystalline, foam-like and defective lattices with thousands of sites takes seconds to minutes.
Tema degli esploratori: fisica e astronomia (elenco arXiv cond-mat.stat-mech, nuovi lavori del giorno).
Categorie arXiv: Statistical Mechanics (cond-mat.stat-mech) ; Mathematical Physics (math-ph).
Pagina del lavoro: https://arxiv.org/abs/2610.41277 — 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-02T07:47:15.678Z dalla pagina https://arxiv.org/list/cond-mat.stat-mech/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).