The following pages link to Bounds on sets with few distances (Q2431616):
Displaying 20 items.
- Bounds on three- and higher-distance sets (Q648975) (← links)
- Towards a proof of the 24-cell conjecture (Q722369) (← links)
- Boundedly connected sets and the distance to the intersection of two sets (Q882021) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- A geometrical characterization of strongly regular graphs (Q1758461) (← links)
- On \(k\)-wise set-intersections and \(k\)-wise Hamming-distances (Q1865379) (← links)
- A new proof of a generalization of Gerzon's bound (Q2043727) (← links)
- On \(q\)-ary codes with two distances \(d\) and \(d+1\) (Q2190983) (← links)
- Maximal 2-distance sets containing the regular simplex (Q2198391) (← links)
- An asymmetric bound for sum of distance sets (Q2234373) (← links)
- Constructions of maximum few-distance sets in Euclidean spaces (Q2290349) (← links)
- Bounds for the sum of distances of spherical sets of small size (Q2689513) (← links)
- Quasiextremal distance sets (Q4454308) (← links)
- Distance Sets on Circles (Q4575239) (← links)
- Constructions of biangular tight frames and their relationships with equiangular tight frames (Q4686242) (← links)
- Bounding the Size of an Almost-Equidistant Set in Euclidean Space (Q5219320) (← links)
- New upper bounds on Enomoto Katona’s coding type problem (Q5313922) (← links)
- Bounds for the minimum distance function (Q5879852) (← links)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
- On the size of maximal binary codes with 2, 3, and 4 distances (Q6615496) (← links)
