A characterization of \(Q\)-polynomial association schemes

DOI10.1016/j.jcta.2011.07.008zbMath1232.05243arXiv1007.0473OpenAlexW1998496899MaRDI QIDQ645960

Hiroshi Nozaki, Hirotake Kurihara

Publication date: 11 November 2011

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1007.0473

zbMATH Keywords

association scheme\(s\)-distance set\(Q\)-polynomial association schemeLarman--Rogers--Seidel theoremspherical embedding of association scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (4)

Polynomial properties on large symmetric association schemes ⋮ A spectral equivalent condition of the \(P\)-polynomial property for association schemes ⋮ An excess theorem for spherical 2-designs ⋮ A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers

Cites Work

• Unnamed Item
• A spectral equivalent condition of the \(P\)-polynomial property for association schemes
• A generalization of Larman-Rogers-Seidel's theorem
• Imprimitive cometric association schemes: constructions and analysis
• There are finitely many \(Q\)-polynomial association schemes with given first multiplicity at least three
• Association schemes with multiple Q-polynomial structures
• Character products and \(Q\)-polynomial group association schemes
• A note on the spherical embeddings of strongly regular graphs
• On Two-Distance Sets in Euclidean Space
• Barycentric Lagrange Interpolation

This page was built for publication: A characterization of \(Q\)-polynomial association schemes