Notes on the Leonard system classification
Combinatorics
2020-03-24 v1
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.
Keywords
Cite
@article{arxiv.2003.09668,
title = {Notes on the Leonard system classification},
author = {Paul Terwilliger},
journal= {arXiv preprint arXiv:2003.09668},
year = {2020}
}
Comments
57 pages