Pages that link to "Item:Q1126289"

The following pages link to Maximum planar sets that determine \(k\) distances (Q1126289):

Displaying 17 items.

• Classification of seven-point four-distance sets in the plane (Q351648) (← links)
• Sparse distance sets in the triangular lattice (Q396964) (← links)
• Complex spherical codes with two inner products (Q499503) (← 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)
• Uniqueness of maximum planar five-distance sets (Q924997) (← links)
• On 5-isosceles sets in the plane, with linear restriction (Q949367) (← links)
• On a generalization of distance sets (Q986118) (← links)
• A proof of a dodecahedron conjecture for distance sets (Q2051877) (← links)
• Sets in \(\mathbb{R}^d\) determining \(k\) taxicab distances (Q2192425) (← links)
• Maximal 2-distance sets containing the regular simplex (Q2198391) (← links)
• Characterizing optimal point sets determining one distinct triangle (Q2299408) (← links)
• The two-distance sets in dimension four (Q2695467) (← links)
• Distance Sets on Circles (Q4575239) (← links)
• (Q4987427) (← links)
• Lattice Configurations Determining Few Distances (Q5148774) (← links)
• Optimal point sets determining few distinct triangles (Q5384222) (← links)