A generalization of Larman-Rogers-Seidel's theorem

DOI10.1016/J.DISC.2011.01.026zbMATH Open1220.51002arXiv0912.2387OpenAlexW2962738276MaRDI QIDQ534036FDOQ534036

Hiroshi Nozaki

Publication date: 10 May 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/0912.2387

Recommendations

• Bounds on three- and higher-distance sets
• Classification of three-distance sets in two dimensional Euclidean space
• An upper bound for the cardinality of an \(s\)-distance set in Euclidean space
• Constructions of maximum few-distance sets in Euclidean spaces
• Spherical two-distance sets

zbMATH Keywords

metric geometry\(s\)-distance settwo-distance setfew distance set

Mathematics Subject Classification ID

General theory of distance geometry (51K05)

Cites Work

• Title not available (Why is that?)
• Problems in algebraic combinatorics
• Spherical codes and designs
• Tight spherical designs. I
• Tight Spherical Disigns, II
• Title not available (Why is that?)
• Spherical two-distance sets
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• New maximal two-distance sets
• Title not available (Why is that?)
• On Two-Distance Sets in Euclidean Space
• An upper bound for the cardinality of an s-distance subset in real euclidean space
• 9-Point and 7-Point Configurations in 3-Space
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (17)

• Biangular lines revisited
• Bounds for sets with few distances distinct modulo a prime ideal
• Design theory from the viewpoint of algebraic combinatorics
• A softer, stronger Lidskii theorem
• Polynomial properties on large symmetric association schemes
• Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\)
• Title not available (Why is that?)
• A characterization of \(Q\)-polynomial association schemes
• On the size of maximal binary codes with 2, 3, and 4 distances
• Title not available (Why is that?)
• Semidefinite programming bounds for spherical three-distance sets
• Constructions of maximum few-distance sets in Euclidean spaces
• Harmonic index designs in binary Hamming schemes
• Bounds on three- and higher-distance sets
• Maximal 2-distance sets containing the regular simplex
• Upper bounds for \(s\)-distance sets and equiangular lines
• On spherical designs of some harmonic indices

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534036)