• Corpus ID: 239616136

# Tight bounds on the maximal area of small polygons: Improved Mossinghoff polygons

@inproceedings{Bingane2021TightBO,
title={Tight bounds on the maximal area of small polygons: Improved Mossinghoff polygons},
author={Christian Bingane},
year={2021}
}
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with n = 2m vertices is not known when m ≥ 7. In this paper, we construct, for each n = 2m and m ≥ 3, a small n-gon whose area is the maximal value of a one-variable function. We show that, for all even n ≥ 6, the area obtained improves by O(1/n5) that of the best prior small n-gon constructed by Mossinghoff. In particular, for n = 6, the small 6-gon constructed has maximal area.
1 Citations

## Figures and Tables from this paper

Tight bounds on the maximal perimeter of convex equilateral small polygons
• Mathematics
• 2021
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \$n=2^s\$ vertices is not known when \$s \ge 4\$. In this paper, we construct a family of

## References

SHOWING 1-10 OF 15 REFERENCES
Maximal perimeter and maximal width of a convex small polygon
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with n = 2s sides are unknown when s ≥ 4. In this paper, we construct a family of
Isodiametric Problems for Polygons
It is shown that the values obtained cannot be improved for large n by more than c1/n3 in the area problem and c2/n5 in the perimeter problem, for certain constants c1 and c1.
The equilateral small octagon of maximal width
• Mathematics
• 2021
A small polygon is a polygon of unit diameter. The maximal width of an equilateral small polygon with n = 2s vertices is not known when s ≥ 3. This paper solves the first open case and finds the
Tight bounds on the maximal perimeter and the maximal width of convex small polygons
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 \$s \ge 4\$. In this paper, we construct a
Largest small polygons: A sequential convex optimization approach
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with \$n=2m\$ vertices is not known when \$m\ge 7\$. Finding the largest small \$n\$-gon for a given number \$n\ge 3\$ can
Tight bounds on the maximal perimeter of convex equilateral small polygons
• Mathematics
• 2021
A small polygon is a polygon of unit diameter. The maximal perimeter of a convex equilateral small polygon with \$n=2^s\$ vertices is not known when \$s \ge 4\$. In this paper, we construct a family of
Finding largest small polygons with GloptiPoly
• Mathematics, Computer Science
J. Glob. Optim.
• 2013
It is shown that a recently developed technique for global polynomial optimization, based on a semidefinite programming approach to the generalized problem of moments and implemented in the public-domain Matlab package GloptiPoly, can successfully find largest small polygons for n = 10 and n-= 12, which significantly improves existing results in the domain.
Ranking small regular polygons by area and by perimeter
• Mathematics
• 2005
From the pentagon onwards, the area of the regular convex polygon with n sides and unit diameter is greater for each odd number n than for the next even number n + 1. Moreover, from the heptagon
Diameter graphs of polygons and the proof of a conjecture of Graham
• Computer Science, Mathematics
J. Comb. Theory, Ser. A
• 2007
We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle.
The Largest Small Hexagon
• R. Graham
• Computer Science, Mathematics
J. Comb. Theory, Ser. A
• 1975
It is shown that such a hexagon is unique and has an area exceeding that of a regular hexagon of unit diameter by about 4%.