An upper bound for the cardinality of an s-distance subset in real euclidean space

DOI10.1007/BF02579266zbMath0491.05024OpenAlexW4239010631MaRDI QIDQ1167178

Eiichi Bannai, Etsuko Bannai

Publication date: 1981

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02579266

zbMATH Keywords

subsets in metric spaces

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Real and complex geometry (51M99) Designs and configurations (05B99)

Related Items

The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\) ⋮ Avoiding right angles and certain Hamming distances ⋮ Lattices with few distances ⋮ A remark on sets with few distances in $\mathbb {R}^{d}$ ⋮ A generalization of Larman-Rogers-Seidel's theorem ⋮ Cardinalities of \(k\)-distance sets in Minkowski spaces ⋮ An upper bound for the cardinality of an s-distance subset in real Euclidean space. II

Cites Work

• Spherical codes and designs
• Tight spherical designs. I
• On Two-Distance Sets in Euclidean Space