The following pages link to On tight spherical designs (Q5891184):
Displayed 14 items.
- On the existence of tight relative 2-designs on binary Hamming association schemes (Q383342) (← links)
- A survey on tight Euclidean \(t\)-designs and tight relative \(t\)-designs in certain association schemes (Q492219) (← links)
- Upper bounds for \(s\)-distance sets and equiangular lines (Q1644979) (← links)
- Nonexistence of certain pseudogeometric graphs (Q1699563) (← links)
- Half of an antipodal spherical design (Q1749378) (← links)
- Complex spherical codes with three inner products (Q1991087) (← links)
- Linear programming bounds for covering radius of spherical designs (Q2038844) (← links)
- Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) (Q2134559) (← links)
- \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
- Classification of spherical 2-distance \(\{4,2,1\}\)-designs by solving Diophantine equations (Q2233595) (← links)
- Automorphisms of a strongly regular graph with parameters \((1305, 440, 115, 165)\) (Q2317368) (← links)
- Design theory from the viewpoint of algebraic combinatorics (Q2361074) (← links)
- New Bounds for Equiangular Lines and Spherical Two-Distance Sets (Q5346565) (← links)
- Spherical Framelets from Spherical Designs (Q6144059) (← links)