A generalization of Larman-Rogers-Seidel's theorem

Details A generalization of Larman-Rogers-Seidel's theorem A generalization of Larman-Rogers-Seidel's theorem

2009-12-12

arxiv.org/abs/0912.2387v3

Mathematics

Metric Geometry

12 pages, no figure

Scientific paper

A finite set X in the d-dimensional Euclidean space is called an s-distance set if the set of Euclidean distances between any 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, we give an extension of this theorem for any s. Namely, if the size of an s-distance set is greater than some value depending on d and s, then certain functions of s distances become integers. Moreover, we prove that if the size of X is greater than the value, then the number of s-distance sets is finite.

Affiliated with

Also associated with

No associations

Rating

A generalization of Larman-Rogers-Seidel's theorem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A generalization of Larman-Rogers-Seidel's theorem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A generalization of Larman-Rogers-Seidel's theorem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-532910