New maximal two-distance sets
From MaRDI portal
Publication:1352878
DOI10.1006/jcta.1997.2749zbMath0871.51009OpenAlexW2144778768WikidataQ56531577 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
Related Items (29)
Classification of isosceles eight-point sets in three-dimensional Euclidean space ⋮ 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 ⋮ Distinct angle problems and variants ⋮ Inside s-inner product sets and Euclidean designs ⋮ Maximal 2-distance sets containing the regular simplex ⋮ Euclidean designs obtained from spherical embedding of coherent configurations ⋮ Constructions and restrictions for balanced splittable Hadamard matrices ⋮ The two-distance sets in dimension four ⋮ Bounds on three- and higher-distance sets ⋮ Biangular lines revisited ⋮ Complex spherical codes with two inner products ⋮ Complex spherical codes with three 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 ⋮ Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) ⋮ On a generalization of distance sets ⋮ On representations of graphs as two-distance sets ⋮ Towards a proof of the 24-cell conjecture ⋮ Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) ⋮ A proof of a dodecahedron conjecture for distance sets ⋮ Spherical two-distance sets ⋮ Graphs and spherical two-distance sets ⋮ A survey on spherical designs and algebraic combinatorics on spheres ⋮ Regular two-distance sets
This page was built for publication: New maximal two-distance sets
