Tight bounds on the maximal perimeter and the maximal width of convex small polygons

DOI10.1007/S10898-022-01181-9MaRDI QIDQ2089891zbMATH OpenOpenAlexFDO

Authors Christian Bingane

Publication date 24 October 2022

Published in Journal of Global Optimization (Search for Journal in Brave)

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

zbMATH Keywords

global optimizationisodiametric problemsmaximal perimetermaximal widthplanar geometrypolygons

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Computational aspects related to convexity (52B55) Nonconvex programming, global optimization (90C26)

Abstract: A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $sge4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$ and $sge3$, and show that the perimeters and the widths obtained cannot be improved for large $n$ by more than $a/n^6$ and $b/n^4$ respectively, for certain positive constants $a$ and $b$. In addition, assuming that a conjecture of Mossinghoff is true, we formulate the maximal perimeter problem as a nonlinear optimization problem involving trigonometric functions and, for $n=2^s$ with $3lesle7$, we provide global optimal solutions.

Recommendations

• Tight bounds on the maximal perimeter of convex equilateral small polygons
• Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons
• Largest small polygons: a sequential convex optimization approach
• The equilateral small octagon of maximal width
• Isodiametric problems for polygons

Cites work

• A discrete isoperimetric problem
• An isodiametric problem for equilateral polygons
• Branching and bounds tighteningtechniques for non-convex MINLP
• Enumerating isodiametric and isoperimetric polygons
• scientific article; zbMATH DE number 4067746 (Why is no real title available?)
• Isodiametric problems for polygons
• Isoperimetric polygons of maximum width
• Largest small polygons: a sequential convex optimization approach
• Most Reinhardt polygons are sporadic
• On convex polygons of maximal width
• Sporadic Reinhardt polygons
• The small octagon with longest perimeter
• The small octagons of maximal width

Cited in

(13)

• Isoperimetric polygons of maximum width
• On convex polygons of maximal width
• Tight bounds on the maximal perimeter of convex equilateral small polygons
• Finding largest small polygons with gloptipoly
• Maximal perimeter, diameter and area of equilateral unit-width convex polygons
• Extremal problems for convex polygons
• Largest small polygons: a sequential convex optimization approach
• The equilateral small octagon of maximal width
• Small polygons with large area
• Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons
• Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
• A zonogon approach for computing small convex polygons of maximum perimeter
• The small octagon with longest perimeter

Describes a project that uses

Uses Software

• GitHub

This page was built for publication: Tight bounds on the maximal perimeter and the maximal width of convex small polygons

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