Pages that link to "Item:Q2290349"

The following pages link to Constructions of maximum few-distance sets in Euclidean spaces (Q2290349):

Displaying 16 items.

• A generalization of Larman-Rogers-Seidel's theorem (Q534036) (← links)
• Bounds on three- and higher-distance sets (Q648975) (← links)
• Maximal \(m\)-distance sets containing the representation of the Johnson graph \(J(n,m)\) (Q713149) (← links)
• Maximal \(m\)-distance sets containing the representation of the Hamming graph \(H(n, m)\) (Q729778) (← links)
• General embedding problems and two-distance sets in Minkowski planes (Q945968) (← links)
• New maximal two-distance sets (Q1352878) (← links)
• Classification of three-distance sets in two dimensional Euclidean space (Q1883614) (← links)
• A proof of a dodecahedron conjecture for distance sets (Q2051877) (← links)
• Maximal 2-distance sets containing the regular simplex (Q2198391) (← links)
• Biangular lines revisited (Q2230922) (← links)
• An upper bound for the cardinality of an \(s\)-distance set in Euclidean space (Q2567394) (← links)
• Classification of partially metric Q-polynomial association schemes with \(m_1=4\) (Q2657076) (← links)
• The two-distance sets in dimension four (Q2695467) (← links)
• Bounding the Size of an Almost-Equidistant Set in Euclidean Space (Q5219320) (← links)
• Nearly \(k\)-distance sets (Q6050211) (← links)
• Semidefinite programming bounds for spherical three-distance sets (Q6635166) (← links)