More on the Terwilliger algebra of Johnson schemes
Benjian Lv, Carolina Maldonado, Kaishun Wang

TL;DR
This paper completes the characterization of the Terwilliger algebra for Johnson schemes by analyzing the case where 2d ≤ n < 3d, extending previous results that covered n ≥ 3d.
Contribution
It provides a complete description of the Terwilliger algebra of Johnson schemes for all parameter ranges, filling a gap in existing literature.
Findings
Determined the Terwilliger algebra for 2d ≤ n < 3d.
Extended the classification of Johnson schemes.
Provided algebraic structures for previously unresolved cases.
Abstract
In [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Math. 307 (2007) 1621--1635], the Terwilliger algebra of the Johnson scheme was determined when . In this paper, we determine the Terwilliger algebra for the remaining case .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFinite Group Theory Research · Coding theory and cryptography · Algebraic structures and combinatorial models
