New upper bound for the cardinalities of $s$-distance sets on the unit sphere

Abstract

We have the Fisher type inequality and the linear programming bound as upper bounds for the cardinalities of $s$-distance sets on $S^{d-1}$. In this paper, we give a new upper bound for the cardinalities of $s$-distance sets on $S^{d-1}$ for any $s$. This upper bound improves the Fisher typer inequality and is useful for $s$-distance sets which are not applicable to the linear programming bound.

5 pages

Cited by in corpus (2)

• Bounds on sets with few distances
• Semidefinite Programming Bounds For Spherical Three-distance Sets