TL;DR
This paper discusses an algorithmic method to compute cuspidal pairs in the Harish-Chandra series of finite reductive groups, based on Lusztig's results.
Contribution
It provides a new algorithmic approach to determine cuspidal pairs, enhancing computational methods in representation theory of finite groups.
Findings
Algorithm for calculating cuspidal pairs described
Utilizes Lusztig's theoretical framework
Improves computational efficiency in representation theory
Abstract
The irreducible characters of a finite reductive group are partitioned into Harish-Chandra series that are labelled by cuspidal pairs. In this note, we describe how one can algorithmically calculate those cuspidal pairs using results of Lusztig.
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.