加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本