Pages that link to "Item:Q534036"

The following pages link to A generalization of Larman-Rogers-Seidel's theorem (Q534036):

Displaying 19 items.

• Polynomial properties on large symmetric association schemes (Q295296) (← links)
• On spherical designs of some harmonic indices (Q528991) (← links)
• A characterization of \(Q\)-polynomial association schemes (Q645960) (← links)
• Bounds on three- and higher-distance sets (Q648975) (← links)
• On a generalization of distance sets (Q986118) (← links)
• A softer, stronger Lidskii theorem (Q1121959) (← links)
• Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
• Harmonic index designs in binary Hamming schemes (Q1696524) (← links)
• Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) (Q2134559) (← links)
• Maximal 2-distance sets containing the regular simplex (Q2198391) (← links)
• Biangular lines revisited (Q2230922) (← links)
• Constructions of maximum few-distance sets in Euclidean spaces (Q2290349) (← links)
• Design theory from the viewpoint of algebraic combinatorics (Q2361074) (← links)
• (Q4399536) (← links)
• (Q4523719) (← links)
• A remark on sets with few distances in $\mathbb {R}^{d}$ (Q5145510) (← links)
• Bounds for sets with few distances distinct modulo a prime ideal (Q6042826) (← links)
• On the size of maximal binary codes with 2, 3, and 4 distances (Q6615496) (← links)
• Semidefinite programming bounds for spherical three-distance sets (Q6635166) (← links)