The following pages link to Bounds on sets with few distances (Q2431616):
Displaying 10 items.
- Bounds on three- and higher-distance sets (Q648975) (← links)
- Towards a proof of the 24-cell conjecture (Q722369) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- A geometrical characterization of strongly regular graphs (Q1758461) (← 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)
- Distance Sets on Circles (Q4575239) (← links)
- Constructions of biangular tight frames and their relationships with equiangular tight frames (Q4686242) (← links)
- Semidefinite programming bounds for binary codes from a split Terwilliger algebra (Q6074024) (← links)
