An upper bound for the cardinality of an s-distance subset in real Euclidean space. II

From MaRDI portal
Revision as of 23:13, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

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






Related Items (38)

Classification of isosceles eight-point sets in three-dimensional Euclidean spaceFew distance sets in \(\ell_p\) spaces and \(\ell_p\) product spacesClassification of three-distance sets in two dimensional Euclidean spaceUpper bounds for \(s\)-distance sets and equiangular linesCharacterization of finite colored spaces with certain conditionsClassification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean spaceBounds for sets with few distances distinct modulo a prime idealNearly \(k\)-distance setsInside s-inner product sets and Euclidean designsMaximal 2-distance sets containing the regular simplexConstructions and restrictions for balanced splittable Hadamard matricesThe two-distance sets in dimension fourBounds on three- and higher-distance setsNearly \(k\)-distance setsUniqueness of maximum planar five-distance setsLattices with few distancesMultilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theoremsA remark on sets with few distances in $\mathbb {R}^{d}$Biangular lines revisitedComplex spherical codes with two inner productsA geometrical characterization of strongly regular graphsA generalization of Larman-Rogers-Seidel's theoremMinimal Euclidean representations of graphsOn isosceles sets in the 4-dimensional Euclidean spaceOn a generalization of distance setsA short proof of the nonuniform Ray-Chaudhuri-Wilson inequalityOn representations of graphs as two-distance setsMaximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\)Constructions of maximum few-distance sets in Euclidean spacesAn upper bound for the size of \(s\)-distance sets in real algebraic setsA proof of a dodecahedron conjecture for distance setsSpherical two-distance setsBounds on the Maximum Number of Vectors with given Scalar ProductsGraphs and spherical two-distance setsOn a problem of Specker about Euclidean representations of finite graphsA survey on spherical designs and algebraic combinatorics on spheresCardinalities of \(k\)-distance sets in Minkowski spacesOn 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