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

DOI10.1007/BF02579266MaRDI QIDQ1167178zbMATH OpenOpenAlexFDO

Authors 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) Designs and configurations (05B99) Real and complex geometry (51M99)

Cites work

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

Cited in

(7)

• 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
• The partition rank of a tensor and \(k\)-right corners in \(\mathbb{F}_q^n\)
• A remark on sets with few distances in \(\mathbb{R}^d\)
• A generalization of Larman-Rogers-Seidel's theorem
• Avoiding right angles and certain Hamming distances

This page was built for publication: An upper bound for the cardinality of an s-distance subset in real euclidean space

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