$\newcommand\R{\mathbb R}\newcommand\S{\mathbb S}$Let $B_d$ and $S_{d-1}$ denote, respectively, the closed unit ball and the unit sphere in $\R^d$. Let us say that a finite subset $F$ of $B_d$ is maximal if the sum of all pairwise Euclidean distances between the points in the set $F$ is the largest possible given $n:=\text{card}\,F$.

In a comment to a post now apparently deleted, Noam D. Elkies noted that, by convexity, (i) any maximal set must lie on $S_{d-1}$ and (ii) such a set must be the set of all vertices of a regular polygon if $d=2$.

This suggests the following questions:

**Q1.** For $d=3$ and $n$ such that there exists a regular polytope with $n$ vertices, is it true that every maximal set must be the set of all vertices of a regular polytope?

**Q2.** For $d=3$ and any given natural $n$, is a maximal set of $n$ distinct points unique up to an orthogonal transformation?

**Q3.** A weaker version of Q2: For $d=3$ and any given natural $n$, are there only finitely many, up to an orthogonal transformation, maximal sets of $n$ distinct points?

**Q4.** Same questions for any $d\ge3$.

**Q5.** Same questions with the Euclidean distances $|x-y|$ between points $x$ and $y$ replaced by increasing functions $f(|x-y|)$ of the distances; e.g., here one may take $f(r)\equiv r^2$ or $f(r)\equiv -1/r^{d-2}$.

The answer to the questions about regular polytopes seem to be positive at least for $n\le d+1$, with the regular simplexes as the regular polytopes.

One of the correct and complete answers to any one of these questions will be accepted as an answer to this entire post.