Symmetry conjecture for optimal even small polygons
Symmetry conjecture for optimal even small polygons
Let be even, and let denote the maximal area among all small -gons. An optimal -gon is a small -gon whose area is . Its diameter graph is the graph whose vertices are the polygon's vertices, with edges joining pairs at distance equal to the diameter, and a pendant edge is an edge incident to a vertex of degree one. Symmetry conjecture. For even , an optimal -gon has an axis of symmetry corresponding to the pendant edge in its diameter graph. The maximal-area problem for even small polygons is not fully resolved; the conjecture proposes additional symmetry for optimal polygons beyond the known structure of their diameter graphs.
Sources & referencesView supporting material
Primary source
Christian Bingane, “Tight bounds on the maximal area of small polygons: Improved Mossinghoff polygons”, arXiv:2110.11741 (2022).
Additional references
2 papers in this index state this conjecture (2011–2021). The statement above is taken from the most recent of them; the others are arXiv:1103.4456.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.