Notes on the Leonard System Classification

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 description of the intersection numbers of a Leonard system.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics Jg. 37; H. 5; S. 1687 - 1748
1. Verfasser: Terwilliger, Paul
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Tokyo Springer Japan 01.09.2021
Springer Nature B.V
Schlagworte:
Combinatorics
Computation
Engineering Design
Isomorphism
Mathematics
Mathematics and Statistics
Original Paper
05E30
Racah polynomial
Leonard pair
15A21
Association scheme
Leonard system
ISSN:0911-0119, 1435-5914
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 description of the intersection numbers of a Leonard system.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-021-02357-y