Problem
Research questions and friction points this paper is trying to address.
Reinhardt polygon
maximum perimeter
small polygon
convex geometry
computer-assisted proof
Reinhardt's Maximum-Perimeter Polygon Problem at n=16, 32, and 64: Computer-Assisted Proof Candidates
🤖 AI Summary
This study addresses the long-standing open problem of determining exact solutions for Reinhardt’s maximal-perimeter small polygons when the number of sides $n$ equals 16, 32, and 64—powers of two for which rigorous proofs have remained elusive. The authors develop a computer-assisted proof framework that integrates dihedral symmetrization, symbolic encoding, strong convexity analysis, and Karush–Kuhn–Tucker (KKT) conditions. By incorporating neighborhood localization, exhaustive filtering, and dihedral orbit elimination strategies, the method efficiently navigates configuration spaces of sizes up to $2^{15}$, $2^{31}$, and $2^{64}$, reducing them to 16, 96, and 896 candidates, respectively. The approach conclusively establishes the uniqueness of the perimeter-maximizing configuration in each case, providing the first complete and rigorous proofs for these instances and introducing a scalable, general-purpose verification architecture.
📝 Abstract
A convex polygon is called small if its diameter is at most one. Reinhardt proved the universal perimeter bound $\mathrm{perim}(P) \leq U_n := 2n\sin(π/(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$. This paper presents computer-assisted proof candidates for the first three open cases, $n=16,32,64$. In each case, the candidate theorem asserts 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, and separate computational cross-checks. These results have not yet received independent human expert review and are therefore deliberately presented as proof candidates rather than literature-established theorems.
Innovation
Methods, ideas, or system contributions that make the work stand out.
computer-assisted proof
difference body
sign code
exact arithmetic
KKT conditions
🔎 Similar Papers
No similar papers found.
