Mossinghoff's symmetry conjecture for maximal-perimeter convex small polygons

At least 5 years old · documented by

Let n=2sn=2^s with integer s≥2s\ge 2, and let Pn∗P_n^* be a convex small nn-gon with the longest perimeter. Its diameter graph records the pairs of vertices at Euclidean distance one.

Mossinghoff's symmetry conjecture. The polygon Pn∗P_n^* has an axis of symmetry corresponding to one particular pendant edge in its diameter graph.

This assertion supplements the conjectured diameter-graph structure of optimal convex small polygons by specifying a geometric symmetry associated with one of its pendant edges. The source gives no resolution, so the conjecture remains open.

References

Primary source

Christian Bingane, “Tight bounds on the maximal perimeter and the maximal width of convex small polygons”, arXiv:2010.02490 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.