3 problems

For $\beta>0$, let … and, for $m\geq 2$, define … A configuration is $L^m_\beta$-universally optimal if it minimizes every admissible periodic energy among $2m$-point configuration…

Let $\mathcal C$ be the code constructed in the paper consisting of $85$ points in $\mathbb C^5$, viewed projectively. A code is universally optimal if it minimizes every admissibl…

Cohn–Kumar conjecture. For $n=2$, $8$, or $24$, the linear programming bounds for potential energy minimization in $\mathbb{R}^n$ are sharp for every completely monotonic potential…