## Finding the Sequence of Largest Small n-Polygons by Numerical Optimization

LSP(n), the largest small polygon with n vertices, is the polygon of unit diameter that has maximal area A(n). It is known that for all odd values n≥3, LSP(n) is the regular n-polygon; however, this statement is not valid for even values of n. Finding the polygon LSP(n) and A(n) for even values n≥6 has … Read more