An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
From MaRDI portal
Publication:1055777
DOI10.1007/BF02579288zbMath0522.05022OpenAlexW4241301183MaRDI QIDQ1055777
Eiichi Bannai, Etsuko Bannai, Dennis W. Stanton
Publication date: 1983
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02579288
Exact enumeration problems, generating functions (05A15) Enumerative combinatorics (05A99) Designs and configurations (05B99)
Related Items (38)
Classification of isosceles eight-point sets in three-dimensional Euclidean space ⋮ Few distance sets in \(\ell_p\) spaces and \(\ell_p\) product spaces ⋮ Classification of three-distance sets in two dimensional Euclidean space ⋮ Upper bounds for \(s\)-distance sets and equiangular lines ⋮ Characterization of finite colored spaces with certain conditions ⋮ Classification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean space ⋮ Bounds for sets with few distances distinct modulo a prime ideal ⋮ Nearly \(k\)-distance sets ⋮ Inside s-inner product sets and Euclidean designs ⋮ Maximal 2-distance sets containing the regular simplex ⋮ Constructions and restrictions for balanced splittable Hadamard matrices ⋮ The two-distance sets in dimension four ⋮ Bounds on three- and higher-distance sets ⋮ Nearly \(k\)-distance sets ⋮ Uniqueness of maximum planar five-distance sets ⋮ Lattices with few distances ⋮ Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems ⋮ A remark on sets with few distances in $\mathbb {R}^{d}$ ⋮ Biangular lines revisited ⋮ Complex spherical codes with two inner products ⋮ A geometrical characterization of strongly regular graphs ⋮ A generalization of Larman-Rogers-Seidel's theorem ⋮ Minimal Euclidean representations of graphs ⋮ On isosceles sets in the 4-dimensional Euclidean space ⋮ On a generalization of distance sets ⋮ A short proof of the nonuniform Ray-Chaudhuri-Wilson inequality ⋮ On representations of graphs as two-distance sets ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) ⋮ Constructions of maximum few-distance sets in Euclidean spaces ⋮ An upper bound for the size of \(s\)-distance sets in real algebraic sets ⋮ A proof of a dodecahedron conjecture for distance sets ⋮ Spherical two-distance sets ⋮ Bounds on the Maximum Number of Vectors with given Scalar Products ⋮ Graphs and spherical two-distance sets ⋮ On a problem of Specker about Euclidean representations of finite graphs ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Cardinalities of \(k\)-distance sets in Minkowski spaces ⋮ On Euclidean designs
Cites Work
This page was built for publication: An upper bound for the cardinality of an s-distance subset in real Euclidean space. II