A generalization of Larman-Rogers-Seidel's theorem

DOI10.1016/j.disc.2011.01.026zbMath1220.51002arXiv0912.2387OpenAlexW2962738276MaRDI QIDQ534036

Hiroshi Nozaki

Publication date: 10 May 2011

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

General theory of distance geometry (51K05)

Related Items (12)

Design theory from the viewpoint of algebraic combinatorics ⋮ Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) ⋮ Polynomial properties on large symmetric association schemes ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ Harmonic index designs in binary Hamming schemes ⋮ Maximal 2-distance sets containing the regular simplex ⋮ A characterization of \(Q\)-polynomial association schemes ⋮ Bounds on three- and higher-distance sets ⋮ Biangular lines revisited ⋮ On spherical designs of some harmonic indices ⋮ Constructions of maximum few-distance sets in Euclidean spaces

Cites Work

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

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