Abstract

Let nn be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex nn-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 nn, there are many Reinhardt polygons with nn sides, and many of them exhibit a particular periodic structure. While these periodic polygons are well understood, for certain values of nn, additional Reinhardt polygons exist that do not possess this structured form. We call these polygons \textit{sporadic}. We completely characterize the integers nn for which sporadic Reinhardt polygons exist, showing that these polygons occur precisely when n=pqrn=pqr with pp and qq distinct odd primes and r≥2r\geq2. We also prove that a positive proportion of the Reinhardt polygons with nn sides are sporadic for almost all integers nn, and we investigate the precise number of sporadic Reinhardt polygons that are produced for several values of nn by a construction that we introduce.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.