Isodiametric problems for polygons
The paper concerns two problems: finding convex \(n\)-gons of unit diameter which have possibly large area (possibly large perimeter). Recall that if \(n\) is odd, then the regular \(n\)-gon has the largest area [\textit{K. Reinhardt}, Extremale Polygone gegebener Durchmessers, Jahresber. Deutsch. Math.-Verein. 31, 251--270 (1922)]. For \(n\) even, the answer is known only for \(n=4\) (which is easy), for \(n=6\) [\textit{R. L. Graham}, J. Comb. Theory, Ser. A 18, 165--170 (1975; Zbl 0299.52006)], and for \(n=8\) [\textit{C. Audet, P. Hansen, F. Messine} and \textit{J. Xiong}, J. Comb. Theory, Ser. A 98, No.~1, 46--59 (2002; Zbl 1022.90013)]. The author of the present paper constructs a convex \(n\)-gon of unit diameter, where \(n\) is even, and shows that the area of this \(n\)-gon cannot be improved for large \(n\) by more than by \(cn^ {-3}\), where \(c\) is a constant. Moreover, for \(n=2^ m\) he presents a construction of a convex \(n\)-gon of unit diameter whose perimeter cannot be improved for large \(n\) by more than by \(cn^ {-5}\), where \(c\) is a constant.
- Isoperimetric polygons of maximum width
- Simple polygons of maximum perimeter contained in a unit disk
- The largest small \(n\)-dimensional polytope with \(n+3\) vertices.
- Most Reinhardt polygons are sporadic
- Sporadic Reinhardt polygons
- Using symbolic calculations to determine largest small polygons
- Tight bounds on the maximal perimeter and the maximal width of convex small polygons
- Extremal problems for spherical convex polygons
- Numerical certification of Pareto optimality for biobjective nonlinear problems
- Tight bounds on the maximal perimeter of convex equilateral small polygons
- Unions of regular polygons with large perimeter-to-area ratio
- Finding largest small polygons with gloptipoly
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- Diameter graphs of polygons and the proof of a conjecture of Graham
- Extremal problems for convex polygons
- Largest small polygons: a sequential convex optimization approach
- Ranking small regular polygons by area and by perimeter
- scientific article; zbMATH DE number 1817206 (Why is no real title available?)
- Asymmetric polygons with maximum area
- An isodiametric problem for equilateral polygons
- A $1 Problem
- The problem of best cut of regular polygons
- On the mean length of the diagonals of an \(n\)-gon
- scientific article; zbMATH DE number 4067746 (Why is no real title available?)
- Inpolygons of minimal diameter
- Enumerating isodiametric and isoperimetric polygons
- Small polygons with large area
- Tight bounds on the maximal area of small polygons: improved Mossinghoff polygons
- The small hexagon and heptagon with maximum sum of distances between vertices
- Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held August 13--18, 2023
- Maximizing the area of polygons via quasicyclic polygons
- A discrete isoperimetric problem
- A zonogon approach for computing small convex polygons of maximum perimeter
- Subdivisions of rotationally symmetric planar convex bodies minimizing the maximum relative diameter
This page was built for publication: Isodiametric problems for polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2505227)
