Notes on the Leonard system classification

2020/03/21 by Terwilliger, Paul · 3 citations
#05E30 #Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.2003.09668

Abstract

Around 2001 we classified the Leonard systems up to isomorphism. The proof was lengthy and involved considerable computation. In this paper we give a proof that is shorter and involves minimal computation. We also give a comprehensive descriptionof the intersection numbers of a Leonard system.

Cited by

• Spin Leonard pairs and the zero diagonal space
• Raising and lowering maps for tridiagonal pairs
• 2-Homogeneous bipartite distance-regular graphs and the quantum group U^′_q(\mathfrakso₆)

Related

• The end-parameters of a Leonard pair
• Leonard pairs having specified end-entries
• A characterization of Leonard pairs using the parameters\n a_{i i=0}^d
• Two linear transformations each tridiagonal with respect to an eigenbasis of the other
• Compatibility and companions for Leonard pairs