An upper bound for the cardinality of an \(s\)-distance set in Euclidean space

DOI10.1007/s00493-003-0032-1zbMath1075.51502OpenAlexW2048741530MaRDI QIDQ2567394

Kazuki Kawasaki, Teppei Sato, Etsuko Bannai, Yusuke Nitamizu

Publication date: 4 October 2005

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00493-003-0032-1

zbMATH Keywords

\(s\)-distance settight designantipodal setspherial design

Mathematics Subject Classification ID

Design of statistical experiments (62K99) Algebraic combinatorics (05E99) Elementary problems in Euclidean geometries (51M04) Designs and configurations (05B99)

Related Items (5)

Tight Gaussian 4-designs ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ Inside s-inner product sets and Euclidean designs ⋮ On Euclidean tight 4-designs ⋮ An upper bound for the size of \(s\)-distance sets in real algebraic sets

This page was built for publication: An upper bound for the cardinality of an \(s\)-distance set in Euclidean space