A characterization of Q-polynomial association schemes
From MaRDI portal
Abstract: We prove a necessary and sufficient condition for a symmetric association scheme to be a Q-polynomial scheme.
Cites work
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- A generalization of Larman-Rogers-Seidel's theorem
- A note on the spherical embeddings of strongly regular graphs
- A spectral equivalent condition of the P-polynomial property for association schemes
- Association schemes with multiple Q-polynomial structures
- Barycentric Lagrange Interpolation
- Character products and \(Q\)-polynomial group association schemes
- Imprimitive cometric association schemes: constructions and analysis
- On Two-Distance Sets in Euclidean Space
- There are finitely many Q-polynomial association schemes with given first multiplicity at least three
Cited in
(10)- Character products and \(Q\)-polynomial group association schemes
- scientific article; zbMATH DE number 1867222 (Why is no real title available?)
- On the isomorphism of certain primitive \(Q\)-polynomial not \(P\)-polynomial association schemes
- A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers
- 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 \(P\)- and \(Q\)-polynomial association schemes
- Some algebra related to \(P\)- and \(Q\)-polynomial association schemes
- Vanishing conditions on parameters for \(P(Q)\)-polynomial association schemes
This page was built for publication: A characterization of \(Q\)-polynomial association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645960)