An equilateral small polygon is an equilateral polygon of diameter 1, or, in the optimization formulation, one for which the distance between any two vertices is at most 1 (Bingane and Audet 2022). The maximum-perimeter problem usually restricts to convex polygons.
Ayala Hoffmann and Ayala Coppola (2026) proved strict local maximality, up to Euclidean motions, of Bingane and Audet's polygons ,
,
and
and reconstructions of their polygons
and
.
For
and 64,
has strictly larger perimeter than
. Consequently, distinct strict local maxima can have
different perimeters, and
and
are not global maximizers. This does not establish global
optimality of the
polygons or solve the maximum-perimeter problem for all
equilateral small polygons with these numbers of sides.
Their criterion uses a balance of Lagrange multipliers with strictly positive multipliers on the active diameter constraints, together with infinitesimal rigidity of the active equality constraints. The numerical applications use exact algebra and validated interval arithmetic, with an additional Lean formalization. The authors report using ChatGPT and Claude in developing the criterion and computational verification procedures.