Metraipolis › archive › dc_20195d41d8df

Weighted flip graphs from cyclic quantum mutations: pentagon inequalities and exponential separations — arXiv:2610.40661

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.40661
License (as archived)
CC0-1.0
Archived
2026-11-02T05:00:47.052Z
SHA-256 of the archived text
d23e66ffc39e2c859cf50e128c11913e194a45b6b19b4eb77185ed53c2eb00d9
Stable URL of this page
https://metraipolis.com/documento/dc_20195d41d8df

How to cite

Weighted flip graphs from cyclic quantum mutations: pentagon inequalities and exponential separations — arXiv:2610.40661 — arXiv (en), https://arxiv.org/abs/2610.40661 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_20195d41d8df (Metraipolis archive dc_20195d41d8df, sha256 d23e66ffc39e2c859cf50e128c11913e194a45b6b19b4eb77185ed53c2eb00d9)
BibTeX
@misc{dc20195d41d8df,
  title = {Weighted flip graphs from cyclic quantum mutations: pentagon inequalities and exponential separations — arXiv:2610.40661},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.40661},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_20195d41d8df; sha256 d23e66ffc39e2c859cf50e128c11913e194a45b6b19b4eb77185ed53c2eb00d9},
  year = {2026}
}

Archived text

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

Positive cyclic quantum mutations at a third root of unity induce an explicit weight on polygon flip graphs. We study the resulting discrepancy between minimum flip count and minimum accumulated normalization loss. Every pentagon three-to-two replacement strictly decreases weight, and in connected types $A_1$, $A_2$, and $A_3$ every minimum-weight path is a flip geodesic. In type $A_4$, however, a six-flip path has smaller weight than the unique five-flip geodesic. A compatible positive projective gluing construction amplifies this example to an exponential success-probability separation in every connected type $A_n$, $n\ge4$. We also give a quantitative perturbation bound preserving the separation. The low-rank minimality statement has an exhaustive finite certificate; the pentagon inequality and the all-rank construction are analytic. In the associated sequential postselection model, differences of path weights determine success-probability ratios independently of the input state. The comparison holds for separately normalized exact mutation steps.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Rings and Algebras (math.RA) ; Algebraic Geometry (math.AG); Combinatorics (math.CO); Quantum Algebra (math.QA).
Pagina del lavoro: https://arxiv.org/abs/2610.40661 — 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-02T04:47:57.709Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).