2012/03/19 by Kevin G. Hare, Hare, Kevin G., Michael J. Mossinghoff +1 · 1 citation
Computer Science · Engineering · Mathematics · #52A10 #52B05 (Secondary) #52B60 (Primary) 11R09 #Advanced Numerical Analysis Techniques #Combinatorics (math.CO) #FOS: Mathematics #Metric Geometry (math.MG) #Number Theory (math.NT) #Point processes and geometric inequalities #Topological and Geometric Data Analysis
paper · pdf · doi:10.48550/arxiv.1203.4107
openalex publication_date 2012/03/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let n be a positive integer, not a power of two. A Reinhardt polygon is a convex n-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width relative to its diameter, and maximal width relative to its perimeter. For almost all n, there are many Reinhardt polygons with n sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of n, additional Reinhardt polygons exist that do not possess this structured form. We call these polygons sporadic. We completely characterize the integers n for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when n=pqr with p and q distinct odd primes and r≥2. We also prove that a positive proportion of the Reinhardt polygons with n sides are sporadic for almost all integers n, and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of n by a construction that we introduce.