← All problems

The maximal edge-length sum conjecture for full grid lattice polygons

3 years old · traced to

Let a(n)a(n) be the maximum of the sum of the squares of the edge-lengths over full grid lattice polygons with nn vertices, and let α(n)\alpha(n) be the explicit lower-bound function defined in the preceding result. Maximal edge-length sum conjecture. For n≥9n\geq 9,

a(n)=α(n).a(n)=\alpha(n).

The conjecture asserts that the construction achieving α(n)\alpha(n) is optimal for every n≥9n\geq 9; the supplied text gives no resolution, so the claim remains open.

References
  1. Oliver Mantas Ališauskas, Giedrius Alkauskas and Valdas Dičiūnas, “Full Grid Lattice Polygons with Maximal Sum of Squares of Edge-Lengths”, arXiv:2311.03011 (2024).

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.