Most Reinhardt polygons are sporadic

Kevin G. Hare, Michael J. Mossinghoff

A \textit{Reinhardt polygon} is a convex $n$-gon that, for $n$ not a power of $2$, is optimal in three different geometric optimization problems, for example, it has maximal perime…