Metraipolis › archive › dc_c995b87af540

Reinhardt's Maximum-Perimeter Polygon Problem for n=16, 32, and 64 — arXiv:2608.08001

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.08001
License (as archived)
CC0-1.0
Archived
2026-10-19T09:05:35.195Z
SHA-256 of the archived text
94389c701f6009a3254ea06bc2fc1845c73483384251bf5b58cd8a24a2fd0a94
Stable URL of this page
https://metraipolis.com/documento/dc_c995b87af540

How to cite

Reinhardt's Maximum-Perimeter Polygon Problem for n=16, 32, and 64 — arXiv:2608.08001 — arXiv (en), https://arxiv.org/abs/2608.08001 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c995b87af540 (Metraipolis archive dc_c995b87af540, sha256 94389c701f6009a3254ea06bc2fc1845c73483384251bf5b58cd8a24a2fd0a94)
BibTeX
@misc{dcc995b87af540,
  title = {Reinhardt's Maximum-Perimeter Polygon Problem for n=16, 32, and 64 — arXiv:2608.08001},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.08001},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c995b87af540; sha256 94389c701f6009a3254ea06bc2fc1845c73483384251bf5b58cd8a24a2fd0a94},
  year = {2026}
}

Archived text

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

A convex polygon is called small if its diameter is at most one. Reinhardt proved the universal perimeter bound $\operatorname{perim}(P)\le U_n:=2n\sin(\pi/(2n))$, and the bound is attained whenever $n$ has a nontrivial odd divisor. The remaining power-of-two cases have resisted exact solution beyond $n=8$. We give computer-assisted proofs of the first three cases, $n=16,32,64$, and in each case prove uniqueness of the maximizing congruence class. The proof architecture is common to all three cases: pass to the difference body $P-P$; encode its reconstruction by a sign code; prove that every global maximizer is saturated, so all difference-body vertices lie on the unit circle; localize every competitive configuration near the regular angle vector; exhaustively screen the sign codes using exact arithmetic; eliminate all nonwinning dihedral orbits; and prove uniqueness inside the winning code by strong convexity and a quantitative KKT argument. The exact certificates cover $2^{15}$ normalized codes for $n=16$, $2^{31}$ normalized codes for $n=32$, and all $2^{64}$ half-codes for $n=64$, leaving respectively $16$, $96$, and $896$ survivors before orbit elimination. The accompanying source package contains the verifiers, recorded outputs, hashes, and separate computational cross-checks.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-11 in math.OC).
Categorie arXiv: Computational Geometry (cs.CG) ; Combinatorics (math.CO); Metric Geometry (math.MG); Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2608.08001 — 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-19T09:03:32.091Z dalla pagina https://arxiv.org/catchup/math.OC/2026-08-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).