arXiv · 2604.21451
Bounding the density of spherical polygon packings
Abstract
We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group ${\rm SO}(3)$. To this end, we introduce an algebraic criterion characterizing when congruent regular spherical polygons have disjoint interiors, leading to a unified formulation of the packing constraints. Using harmonic analysis on ${\rm SO}(3)$, we reduce the theta number to a trigonometric sum-of-squares problem, which can be solved via semidefinite programming.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Fernando Mário de Oliveira Filho, Andreas Spomer, Frank Vallentin. 2026-04-23. Bounding the density of spherical polygon packings. https://arxiv.org/abs/2604.21451
Cite the original work for its findings. Save a collection to share your selection of sources.