English

Mullineux map: $d$-balanced partitions and $d$-runner matrices

Combinatorics 2025-04-08 v1 Representation Theory

Abstract

Let 1<d<e1<d<e be two coprime integers and let mem_e denote the Mullineux map, which for ee prime describes tensor products of the irreducible modules of symmetric groups with the sign in characteristic ee. We prove that if λ\lambda is an ee-regular partition such that dd divides the arm length of any rim hook of λ\lambda of size divisible by ee, then me(λ)m_e(\lambda)' is a partition such that the arm length of any of its rim hooks of size divisible by ee is congruent to 1-1 modulo dd. We introduce a new parameter for partitions called the dd-runner matrix and show that if λ\lambda is as above, then the dd-runner matrices of λ\lambda and me(λ)m_e(\lambda)' agree. This determines me(λ)m_e(\lambda)' uniquely. We approach the whole problem combinatorially and take advantage of a new Abacus Mullineux Algorithm introduced in this paper. We also establish equivalent descriptions of the above partitions which provide an alternative version of the main result about the Mullineux map, which becomes particularly strong when d=2d=2.

Keywords

Cite

@article{arxiv.2504.03864,
  title  = {Mullineux map: $d$-balanced partitions and $d$-runner matrices},
  author = {Pavel Turek},
  journal= {arXiv preprint arXiv:2504.03864},
  year   = {2025}
}

Comments

54 pages, 28 figures

R2 v1 2026-06-28T22:47:38.821Z