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

2009/06/01 by Nozaki, Hiroshi
#52C10 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.0906.0195

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.

Related

• On a generalization of distance sets
• New bounds for spherical two-distance sets
• A generalization of Gerzon's bound on spherical s-distance sets
• Bounds on s-distance sets with strength t
• An upper bound for the size of s-distance sets in real algebraic sets