Biggest little polygon


In geometry, the biggest little polygon for a number n is the n-sided polygon that has diameter one and that has the largest area among all diameter-one n-gons. One non-unique solution when n = 4 is a square, and the solution is a regular polygon when n is an odd number, but the solution is irregular otherwise.

Quadrilaterals

For n = 4, the area of an arbitrary quadrilateral is given by the formula S = pq sin/2 where p and q are the two diagonals of the quadrilateral and θ is either of the angles they form with each other. In order for the diameter to be at most 1, both p and q must themselves be at most 1. Therefore, the quadrilateral has largest area when the three factors in the area formula are individually maximized, with p = q = 1 and sin = 1. The condition that p = q means that the quadrilateral is an equidiagonal quadrilateral, and the condition that sin = 1 means that it is an orthodiagonal quadrilateral. The quadrilaterals of this type include the square with unit-length diagonals, which has area 1/2. However, infinitely many other orthodiagonal and equidiagonal quadrilaterals also have diameter 1 and have the same area as the square, so in this case the solution is not unique.

Odd numbers of sides

For odd values of n, it was shown by Karl Reinhardt that a regular polygon has largest area among all diameter-one polygons.

Even numbers of sides

In the case n = 6, the unique optimal polygon is not regular. The solution to this case was published in 1975 by Ronald Graham, answering a question posed in 1956 by Hanfried Lenz; it takes the form of an irregular equidiagonal pentagon with an obtuse isosceles triangle attached to one of its sides, with the distance from the apex of the triangle to the opposite pentagon vertex equal to the diagonals of the pentagon. Its area is 0.674981...., a number that satisfies the equation
Graham conjectured that the optimal solution for the general case of even values of n consists in the same way of an equidiagonal -gon with an isosceles triangle attached to one of its sides, its apex at unit distance from the opposite -gon vertex. In the case n = 8 this was verified by a computer calculation by Audet et al.
Graham's proof that his hexagon is optimal, and the computer proof of the n = 8 case, both involved a case analysis of all possible n-vertex thrackles with straight edges.
The full conjecture of Graham, characterizing the solution to the biggest little polygon problem for all even values of n, was proven in 2007 by Foster and Szabo.