Sporadic Reinhardt polygons
Abstract
Let be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex -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 , there are many Reinhardt polygons with sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of , additional Reinhardt polygons exist that do not possess this structured form. We call these polygons \textit{sporadic}. We completely characterize the integers for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when with and distinct odd primes and . We also prove that a positive proportion of the Reinhardt polygons with sides are sporadic for almost all integers , and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of by a construction that we introduce.
Cite
@article{arxiv.1203.4107,
title = {Sporadic Reinhardt polygons},
author = {Kevin G. Hare and Michael J. Mossinghoff},
journal= {arXiv preprint arXiv:1203.4107},
year = {2012}
}