A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\)

DOI10.1016/j.laa.2012.10.025zbMath1266.15018arXiv1205.4368MaRDI QIDQ1938685

Edward Hanson

Publication date: 22 February 2013

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

orthogonal polynomials; distance-regular graph; tridiagonal pair; Leonard pair

Mathematics Subject Classification ID

05E30: Association schemes, strongly regular graphs

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A21: Canonical forms, reductions, classification

Related Items

Unnamed Item, How to recognize a Leonard pair, A characterization of \(Q\)-polynomial distance-regular graphs using the intersection numbers, A characterization of bipartite Leonard pairs using the notion of a tail

Cites Work

• Unnamed Item
• The \(Q\)-polynomial idempotents of a distance-regular graph
• A characterization of Leonard pairs using the notion of a tail
• The subconstituent algebra of an association scheme. I
• Tridiagonal pairs of \(q\)-Racah type
• A characterization of \(Q\)-polynomial distance-regular graphs
• Leonard pairs and the \(q\)-Racah polynomials
• Two linear transformations each tridiagonal with respect to an eigenbasis of the other; comments on the parameter array
• Introduction to Leonard pairs.
• Three mutually adjacent Leonard pairs
• Two linear transformations each tridiagonal with respect to an eigenbasis of the other; the TD-D canonical form and the LB-UB canonical form
• LEONARD PAIRS AND THE ASKEY–WILSON RELATIONS
• Two linear transformations each tridiagonal with respect to an eigenbasis of the other