Crystal isomorphisms and Mullineux involution II
Abstract
We present a new combinatorial and conjectural algorithm for computing the Mullineux involution for the symmetric group and its Hecke algebra. This algorithm is built on a conjectural property of crystal isomorphisms which can be rephrased in a purely combinatorial way.
Origin | Files produced by the author(s) |
---|