A discrete isoperimetric problem

DOI10.1023/A:1004997002327MaRDI QIDQ674793zbMATH OpenOpenAlexFDO

Authors Basudeb Datta

Publication date 27 October 1997

Published in Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1004997002327

zbMATH Keywords

extremal n-gonsmaximum perimeter

Mathematics Subject Classification ID

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

Review text

Let \(\pi (n)\) be the maximum perimeter of a convex \(n\)-gon of diameter \(1\). \textit{D. G. Larman} and \textit{N. K. Tamvakis} [Ann. Discrete Math. 20, 209-214 (1984; Zbl 0565.52002)] have proved that \(\pi (n)=2n\sin (\pi /2n)\) whenever \(n\) is not a power of \(2\). The author shows that \(\pi (n)\leq 2n\sin (\pi /2n)\) for arbitrary \(n\geq 3\) with equality only if \(n\) is not a power of \(2\). For the latter case, he gives an explicit construction of all extremal \(n\)-gons based on a one-to-one correspondence with the solutions of a certain diophantine problem. Each of these extremal \(n\)-gons has equal sides and is inscribed in a Reuleaux \(l\)-gon for an odd integer \(l\), \(1<l\leq n\). (As the author remarks, this property was proved already by Reinhardt in 1922.) For \(n\) a power of 2, the problem is solved completely only for \(n=4\).

Recommendations

• Isodiametric problems for polygons
• An isodiametric problem for equilateral polygons
• Enumerating isodiametric and isoperimetric polygons
• On the perimeters of simple polygons contained in a disk

Cited in

(20)

• Isoperimetric polygons of maximum width
• Small convex polytopes with long edges and many vertices
• Sporadic Reinhardt polygons
• Tight bounds on the maximal perimeter and the maximal width of convex small polygons
• Extremal problems for spherical convex polygons
• Tight bounds on the maximal perimeter of convex equilateral small polygons
• 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
• Isodiametric problems for polygons
• Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
• Isoperimetrically optimal polygons in the triangular grid
• An isodiametric problem for equilateral polygons
• A $1 Problem
• scientific article; zbMATH DE number 3948287 (Why is no real title available?)
• Enumerating isodiametric and isoperimetric polygons
• On the perimeters of simple polygons contained in a disk
• Some analogues of isoperimetric inequality
• A zonogon approach for computing small convex polygons of maximum perimeter
• The small octagon with longest perimeter

This page was built for publication: A discrete isoperimetric problem

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