There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three

DOI10.1016/j.ejc.2008.07.009zbMath1169.05054MaRDI QIDQ1011512

William J. Martin, Jason S. Williford

Publication date: 8 April 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.07.009

zbMATH Keywords

distance regular graphs; Q-polynomial association schemes; rank of firts idempotent

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

Related Items

There are only finitely many distance-regular graphs of fixed valency greater than two, Nonexistence of exceptional imprimitive \(Q\)-polynomial association schemes with six classes, A characterization of \(Q\)-polynomial association schemes, Universal lower bounds for potential energy of spherical codes, A survey on spherical designs and algebraic combinatorics on spheres, Commutative association schemes, On the connectivity of graphs in association schemes, On the ideal of the shortest vectors in the Leech lattice and other lattices

Cites Work

• Imprimitive cometric association schemes: constructions and analysis
• Bounding the diameter of distance. Regular graphs
• Eigenvalue multiplicities of highly symmetric graphs
• Splitting fields of association schemes
• Spherical codes and designs
• Problems in algebraic combinatorics
• Imprimitive Q-polynomial association schemes
• Association schemes with multiple Q-polynomial structures
• There are finitely many triangle-free distance-regular graphs with degree 8, 9 or 10
• Two theorems concerning the Bannai-Ito conjecture
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item