A note on the maximal perimeter and maximal width of a convex small polygon

Abstract

The polygon $P$ is small if its diameter equals one. When $n=2^s$, it is still an open problem to find the maximum perimeter or the maximum width of a small $n$-gon. Motivated by Bingane's series of works, we improve the lower bounds for the maximum perimeter and the maximum width.

arXiv comment13 pages, 6 figures

References in corpus (3)

• Tight bounds on the maximal perimeter and the maximal width of convex small polygons
• Sporadic Reinhardt polygons
• Maximal perimeter and maximal width of a convex small polygon