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

DOI10.1016/0097-3165(87)90042-2zbMath0663.05016OpenAlexW2003591253MaRDI 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 representationleafP-polynomial schemespointwise semi-definite matricesQ-polynomial propertysymmetric d-class association scheme

Mathematics Subject Classification ID

Other designs, configurations (05B30)

Related Items (25)

A new inequality for distance-regular graphs ⋮ Kite-free distance-regular graphs ⋮ Distance-regular digraphs of girth 4 ⋮ On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ Twice Q-polynomial distance-regular graphs are thin ⋮ P and Q polynomial schemes with \(q=-1\) ⋮ Association schemes with multiple Q-polynomial structures ⋮ Quantum isomorphism of graphs from association schemes ⋮ A characterization of Leonard pairs using the notion of a tail ⋮ Extremal 1-codes in distance-regular graphs of diameter 3 ⋮ Leonard pairs from 24 points of view. ⋮ Leaves in representation diagrams of bipartite distance-regular graphs ⋮ Character products and \(Q\)-polynomial group association schemes ⋮ The subconstituent algebra of an association scheme. I ⋮ Designs as maximum codes in polynomial metric spaces ⋮ A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers ⋮ On pseudo-distance-regularity ⋮ Connectivity concerning the last two subconstituents of a \(Q\)-polynomial distance-regular graph ⋮ Two linear transformations each tridiagonal with respect to an eigenbasis of the other ⋮ Scaffolds: a graph-theoretic tool for tensor computations related to Bose-Mesner algebras ⋮ The Norton algebra of a \(Q\)-polynomial distance-regular graph ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Energy bounds for codes in polynomial metric spaces ⋮ A duality of scaffolds for translation 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

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