An upper bound for the cardinality of an s-distance subset in real euclidean space
From MaRDI portal
Publication:1167178
DOI10.1007/BF02579266zbMath0491.05024MaRDI QIDQ1167178
Publication date: 1981
Published in: Combinatorica (Search for Journal in Brave)
05A05: Permutations, words, matrices
51M99: Real and complex geometry
05B99: Designs and configurations
Related Items
A generalization of Larman-Rogers-Seidel's theorem, An upper bound for the cardinality of an s-distance subset in real Euclidean space. II, Lattices with few distances, Cardinalities of \(k\)-distance sets in Minkowski spaces
Cites Work