Mullineux involution and crystal isomorphisms
Abstract
We develop a new approach for the computation of the Mullineux involution for the symmetric group and its Hecke algebra using the notion of crystal isomorphism and the Iwahori-Matsumoto involution for the affine Hecke algebra of type A. As a consequence, we obtain several new elementary combinatorial algorithms for its computation, one of which is equivalent to Xu's algorithm (and thus Mullineux' original algorithm). We thus obtain a simple interpretation of these algorithms and a new elementary proof that they indeed compute the Mullineux involution.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.