Discrete & Computational Geometry

, Volume 49, Issue 3, pp 540–557

Sporadic Reinhardt Polygons

Article

DOI: 10.1007/s00454-012-9479-4

Cite this article as:
Hare, K.G. & Mossinghoff, M.J. Discrete Comput Geom (2013) 49: 540. doi:10.1007/s00454-012-9479-4

Abstract

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, which 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\ge 2\). We also prove that a positive proportion of the Reinhardt polygons with \(n\) sides is 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.

Keywords

Reinhardt polygonReinhardt polynomialIsodiametric problemIsoperimetric problemDiameterPerimeterWidth

Mathematics Subject Classification (2000)

Primary: 52B60Secondary: 11R0952A1052B05

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.Department of Pure MathematicsUniversity of WaterlooWaterlooCanada
  2. 2.Department of MathematicsDavidson CollegeDavidsonUSA