New maximal two-distance sets
From MaRDI portal
Publication:1352878
DOI10.1006/jcta.1997.2749zbMath0871.51009WikidataQ56531577 ScholiaQ56531577MaRDI QIDQ1352878
Publication date: 8 April 1997
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcta.1997.2749
51K05: General theory of distance geometry
Related Items
Characterization of finite colored spaces with certain conditions, Distinct angle problems and variants, Complex spherical codes with two inner products, A generalization of Larman-Rogers-Seidel's theorem, On isosceles sets in the 4-dimensional Euclidean space, Bounds on three- and higher-distance sets, Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\), Towards a proof of the 24-cell conjecture, Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\), Regular two-distance sets, Classification of isosceles eight-point sets in three-dimensional Euclidean space, Classification of isosceles 7-point 3-distance sets in 3-dimensional Euclidean space, Minimal Euclidean representations of graphs, On a generalization of distance sets, Spherical two-distance sets, A survey on spherical designs and algebraic combinatorics on spheres, Upper bounds for \(s\)-distance sets and equiangular lines, A geometrical characterization of strongly regular graphs, Classification of three-distance sets in two dimensional Euclidean space, Complex spherical codes with three inner products, A proof of a dodecahedron conjecture for distance sets, Maximal 2-distance sets containing the regular simplex, Biangular lines revisited, On representations of graphs as two-distance sets, Graphs and spherical two-distance sets, Inside s-inner product sets and Euclidean designs, Constructions and restrictions for balanced splittable Hadamard matrices, The two-distance sets in dimension four
