A generalization of Larman-Rogers-Seidel's theorem (Q534036): Difference between revisions

A finite set \(X\) in the \(d\)-dimensional Euclidean space is an \(s\)-distance set if the set of Euclidean distances between two distinct points of \(X\) has size \(s\). Larman-Rogers-Seidel proved that if the cardinality of a two-distance set is greater than \(2d+ 3\), then there exists an integer \(k\) such that \(a^2/b^2= (k- 1)/k\), where \(a\) and \(b\) are the distances. In this paper, the following extension of the result by Larman et al. is established: If \(X\) is an \(s\)-distance set in \(\mathbb{R}^d\) with \(s\geq 2\), \(A(X)= \{\alpha_1,\alpha_2,\dots,\alpha_s\}\), and \(|X|\geq 2{d+s-1\choose s-1}+ 2{d+s-2\choose s-2}\), then \(\prod_{\substack{ i= 1,2,\dots, s\\ j\neq i}} {\alpha^2_j\over \alpha^2_j- \alpha^2_i}\) is an integer \(k_i\) for each \(i= 1,2,\dots, s\) and \(|k_i|= \left\lfloor{1\over 2}+ \sqrt{{N^2\over 2N-2}+{1\over 4}}\right\rfloor\). Moreover, the author also proves that there are finitely many \(s\)-distance sets \(X\) in \(\mathbb{R}^d\) with \(|X|\geq 2{d+s-1\choose s-1}+ 2{d+s-2\choose s-2}\).