Improvement of generalization of Larman-Rogers-Seidel's theorem

Abstract: A finite set

X

in the

d

-dimensional Euclidean space is called an

s

-distance set if the set of distances between any two distinct points of

X

has size

s

. In 1977, Larman-Rogers-Seidel proved that if the cardinality of an two-distance set is large enough, then there exists an integer

k

such that the two distances

a l p h a

,

having the integer condition, namely,

. In 2011, Nozaki generalized Larman-Rogers-Seidel's theorem to the case of

s

-distance sets, i.e. if the cardinality of an

s

-distance set

| X | g e q s l a n t 2 N

with distances

a l p h a_{1}, a l p h a_{2}, c d o t s, a l p h a_{s}

, where

, then the numbers

k_{i} = p r o d_{j = 1, 2, c d o t s, s, e x t j e q i} f r a c a l p h a_{j}^{2} a l p h a_{j}^{2} - a l p h a_{i}^{2}

are integers. In this note, we reduce the lower bound of the requirement of integer condition of

s

-distance sets in

m a t h b b R^{d}

. Furthermore, we can show that there are only finitely many

s

-distance sets

X

in

m a t h b b R^{d}

with

This page was built for publication: Improvement of generalization of Larman-Rogers-Seidel's theorem