Pith. sign in

REVIEW 2 cited by

Notes on the Leonard system classification

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2003.09668 v1 pith:4FHOYYYK submitted 2020-03-21 math.CO

Paul Terwilliger This is my paper · ORCID
classification math.CO
keywords leonardcomputationgiveproofsystemaroundclassificationclassified
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Variations on a circular Hessenberg pair

    math.CO 2026-07 conditional novelty 6.0 of 10

    Quasi-circular Hessenberg systems and systems satisfying the tridiagonal relations are the same family; the tridiagonal-relations family splits exactly into the circular and tridiagonal-Hessenberg cases.

  2. Circular Hessenberg pairs and the tridiagonal relations

    math.CO 2026-07 accept novelty 6.0 of 10

    Every circular Hessenberg pair on a finite-dimensional vector space satisfies the two tridiagonal relations.

Pith tools