Parameters of association schemes that are both P- and Q-polynomial
From MaRDI portal
Publication:789391
DOI10.1016/0097-3165(84)90042-6zbMath0533.05016OpenAlexW1989976686MaRDI QIDQ789391
Publication date: 1984
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(84)90042-6
Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Other designs, configurations (05B30)
Related Items (17)
A characterization of \(P\)- and \(Q\)-polynomial association schemes ⋮ P and Q polynomial schemes with \(q=-1\) ⋮ Leonard pairs from 24 points of view. ⋮ A linear map acts as a Leonard pair with each of the generators of \(U(s l_2)\) ⋮ Non-symmetric, metric, cometric association schemes are self-dual ⋮ Leonard triples, the Racah algebra, and some distance-regular graphs of Racah type ⋮ Two linear transformations each tridiagonal with respect to an eigenbasis of the other ⋮ \(m\)-distance-regular graphs and their relation to multivariate \(P\)-polynomial association schemes ⋮ Directed distance regular graphs with the Q-polynomial property ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Metric coset schemes revisited ⋮ Two linear transformations each tridiagonal with respect to an eigenbasis of the other; the TD-D canonical form and the LB-UB canonical form ⋮ Thin \(Q\)-polynomial distance-regular graphs have bounded \(c_2\) ⋮ The Terwilliger algebra of a 2-homogeneous bipartite distance-regular graph ⋮ The classification of distance-regular graphs of type IIB ⋮ A class of distance-regular graphs that are \(\phi\)-polynomial ⋮ Completely regular clique graphs. II
Cites Work
This page was built for publication: Parameters of association schemes that are both P- and Q-polynomial