Notes on the Leonard system classification

From MaRDI portal
Publication:2051883

DOI10.1007/S00373-021-02357-YzbMATH Open1479.05373arXiv2003.09668OpenAlexW3181708376MaRDI QIDQ2051883FDOQ2051883


Authors: Paul Terwilliger Edit this on Wikidata


Publication date: 25 November 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/2003.09668




Recommendations




Cites Work


Cited In (15)





This page was built for publication: Notes on the Leonard system classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051883)