A characterization of bipartite Leonard pairs using the notion of a tail
From MaRDI portal
Publication:2451662
DOI10.1016/j.laa.2014.03.010zbMath1391.15045arXiv1308.3826MaRDI QIDQ2451662
Publication date: 4 June 2014
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.3826
05E30: Association schemes, strongly regular graphs
15A03: Vector spaces, linear dependence, rank, lineability
15A21: Canonical forms, reductions, classification
Related Items
Unnamed Item, How to recognize a Leonard pair, A \(Q\)-polynomial structure associated with the projective geometry \(L_N (q)\), A \(Q\)-polynomial structure for the attenuated space poset \(\mathcal{A}_q (N, M)\), Notes on the Leonard system classification
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
- A characterization of \(Q\)-polynomial distance-regular graphs
- Leaves in representation diagrams of bipartite distance-regular graphs
- Tails of bipartite distance-regular graphs
- A characterization of Leonard pairs using the parameters \(\{a_i\}^d_{i=0}\)
- Affine transformations of a Leonard pair
- Two linear transformations each tridiagonal with respect to an eigenbasis of the other