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 reduces in fact to iterations of a very elementary procedure on sequences of integers.