Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons

DOI10.1007/S00454-022-00374-ZMaRDI QIDQ6156093zbMATH OpenFDO

Authors Christian Bingane

Publication date 12 June 2023

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2110.11741

zbMATH Keywords

polygonsplanar geometryisodiametric problemmaximal area

Mathematics Subject Classification ID

Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Abstract: A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $mge7$. In this paper, we construct, for each $n=2m$ and $mge3$, a small $n$-gon whose area is the maximal value of a one-variable function. We show that, for all even $nge6$, the area obtained improves by $O(1/n^5)$ that of the best prior small $n$-gon constructed by Mossinghoff. In particular, for $n=6$, the small $6$-gon constructed has maximal area.

Recommendations

• Tight bounds on the maximal perimeter and the maximal width of convex small polygons
• Tight bounds on the maximal perimeter of convex equilateral small polygons
• Isodiametric problems for polygons
• The equilateral small octagon of maximal width
• Using symbolic calculations to determine largest small polygons

Cites work

• Diameter graphs of polygons and the proof of a conjecture of Graham
• Finding largest small polygons with gloptipoly
• Isodiametric problems for polygons
• Maximal Area of Equilateral Small Polygons
• Ranking small regular polygons by area and by perimeter
• The equilateral small octagon of maximal width
• The largest small hexagon
• The largest small octagon

Cited in

(6)

• Ranking small regular polygons by area and by perimeter
• Tight bounds on the maximal perimeter of convex equilateral small polygons
• Largest small polygons: a sequential convex optimization approach
• The equilateral small octagon of maximal width
• Tight bounds on the maximal perimeter and the maximal width of convex small polygons
• Small polygons with large area

This page was built for publication: Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6156093)