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

DOI10.1016/0097-3165(87)90042-2zbMath0663.05016MaRDI QIDQ1114694

Paul M. Terwilliger

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0097-3165(87)90042-2

zbMATH Keywords

geometric representation; leaf; P-polynomial schemes; pointwise semi-definite matrices; Q-polynomial property; symmetric d-class association scheme

Mathematics Subject Classification ID

05B30: Other designs, configurations

Related Items

On pseudo-distance-regularity, Two linear transformations each tridiagonal with respect to an eigenbasis of the other, Extremal 1-codes in distance-regular graphs of diameter 3, A characterization of Leonard pairs using the notion of a tail, The subconstituent algebra of an association scheme. I, On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property, Distance-regular digraphs of girth 4, P and Q polynomial schemes with \(q=-1\), Designs as maximum codes in polynomial metric spaces, A new inequality for distance-regular graphs, Association schemes with multiple Q-polynomial structures, Leonard pairs from 24 points of view., Leaves in representation diagrams of bipartite distance-regular graphs, On upper bounds for code distance and covering radius of designs in polynomial metric spaces, Kite-free distance-regular graphs, Twice Q-polynomial distance-regular graphs are thin, Character products and \(Q\)-polynomial group association schemes, Two linear transformations each tridiagonal with respect to an eigenbasis of the other; the TD-D canonical form and the LB-UB canonical form

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parameters of association schemes that are both P- and Q-polynomial
• The classification of distance-regular graphs of type IIB
• Characterization of H(n,q) by the parameters
• Characterization of projective graphs
• Root systems and the Johnson and Hamming graphs
• Characerization of a class of distance regular graphs.
• Some q-Krawtchouk Polynomials on Chevalley Groups