Abstract
AbstractAround 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 description of the intersection numbers of a Leonard system.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference26 articles.
1. Askey, R., Wilson, J.: A set of orthogonal polynomials that generalize the Racah coefficients or 6-j symbols. SIAM J. Math. Anal. 10, 1008–1016 (1979)
2. Bannai, E., Ito, T.: Algebraic Combinatorics I. Association Schemes. The Benjamin/Cummings Publishing Co. Inc., Menlo Park (1984)
3. Brouwer, A.E., Cohen, A., Neumaier, A.: Distance-Regular Graphs. Springer-Verlag, Berlin (1989)
4. Cerzo, D.R.: Structure of thin irreducible modules of a $$Q$$-polynomial distance-regular graph. Linear Algebra Appl. 433, 1573–1613 (2010)
5. Delsarte, P.: An algebraic approach to the association schemes of coding theory. Philips Research Reports Suppl. (1973)
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献