Pages that link to "Item:Q1011512"

The following pages link to There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three (Q1011512):

Displaying 12 items.

• There are only finitely many distance-regular graphs of fixed valency greater than two (Q475256) (← links)
• Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes (Q616370) (← links)
• A characterization of \(Q\)-polynomial association schemes (Q645960) (← links)
• Universal lower bounds for potential energy of spherical codes (Q730083) (← links)
• A survey on spherical designs and algebraic combinatorics on spheres (Q1039420) (← links)
• Commutative association schemes (Q1039424) (← links)
• On the connectivity of graphs in association schemes (Q1691090) (← links)
• Rationality of the inner products of spherical \(s\)-distance \(t\)-designs for \(t \geq 2s - 2\), \(s \geq 3\) (Q2134559) (← links)
• Spherical embeddings of symmetric association schemes in 3-dimensional Euclidean space (Q2308495) (← links)
• On the ideal of the shortest vectors in the Leech lattice and other lattices (Q2346759) (← links)
• Classification of partially metric Q-polynomial association schemes with \(m_1=4\) (Q2657076) (← links)
• On few-class Q-polynomial association schemes: feasible parameters and nonexistence results (Q5156012) (← links)