Algorithms on the Pyasetskii involution on local Langlands parameters of classical groups
Alexander Hazeltine, Chi-Heng Lo

TL;DR
This paper presents an algorithm to compute the Pyasetskii involution for classical groups, combining existing algorithms and providing a geometric interpretation for certain cases.
Contribution
It introduces a new algorithm for the Pyasetskii involution on classical groups and offers a geometric perspective on the bad parity case.
Findings
Algorithm successfully computes the Pyasetskii involution for specified groups.
Combines Moeglin-Waldspurger and Lanard-Mínguez algorithms.
Provides geometric interpretation for bad parity representations.
Abstract
We give an algorithm to compute the Pyasetskii involution for , and . The algorithm is a combination of Moeglin-Waldspurger's algorithm for the Pyasetskii involution for ([MW86]) and Lanard-Mnguez's algorithm for the Aubert-Zelevinsky involution of bad parity representations for classical groups ([LM25]). In particular, we give a geometric interpretation of the bad parity case of Lanard-Mnguez's algorithm.
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.
