# The minimizers of the $p$-frame potential

## TL;DR

This paper determines the unique set of vectors that minimizes the $p$-frame potential for $N=d+1$ and $p$ in (0,2), confirming a previous conjecture and solving the minimization problem in this case.

## Contribution

It establishes the unique minimizer of the $p$-frame potential for $N=d+1$ and $p$ in (0,2), confirming a conjecture and completing the minimization analysis for this scenario.

## Key findings

- Identifies the unique minimizer of the $p$-frame potential for $N=d+1$ and $p$ in (0,2).
- Confirms a conjecture by Chen et al. regarding the minimization problem.
- Provides a complete solution to the minimization problem in the specified case.

## Abstract

For any positive real number $p$, the $p$-frame potential of $N$ unit vectors $X:=\{\mathbf x_1,\ldots,\mathbf x_N\}\subset \mathbb R^d$ is defined as ${\rm FP}_{p,N,d}(X)=\sum_{i\neq j}|\langle \mathbf x_i,\mathbf x_j\rangle |^p$. In this paper, we focus on the special case $N=d+1$ and establish the unique minimizer of ${\rm FP}_{p,d+1,d}$ for $p\in (0,2)$. Our results completely solve the minimization problem of $p$-frame potential when $N=d+1$, which confirms a conjecture posed by Chen, Gonzales, Goodman, Kang and Okoudjou.