Simple polygons of maximum perimeter contained in a unit disk (Q1017919): Difference between revisions

The authors define a \textit{simple polygon} in \(\mathbb{R}^2\) as a union of finitely many straight line segments which is homeomorphic to a circle. The paper is devoted to the following question from [\textit{P. Brass, W. Moser} and \textit{J. Pach}, Research problems in discrete geometry. (New York), NY: Springer. (2005; Zbl 1086.52001)], {p.~437}: Find the supremum of perimeters of simple \(n\)-sided polygons contained in the unit disk and find polygons for which it is almost attained. In the op cit it was mentioned that for even \(n\) the problem is trivial and the supremum is \(2n\). The main purpose of the paper is to show that for odd \(n\geq 5\) the close-to-optimal polygons are arbitrarily close to an isosceles triangle, and that for \(n=3\) the optimal solution is an equilateral triangle.