The complexities of some simple modules of the symmetric groups
Kay Jin Lim, Kai Meng Tan

TL;DR
This paper investigates the complexities of simple modules in Rouquier blocks of symmetric groups, revealing that their complexity equals the p-weight when less than p, and providing specific complexity values for certain modules.
Contribution
It establishes the common complexity of simple modules in Rouquier blocks with p-weight less than p and determines the complexities of specific modules when p is odd.
Findings
Simple modules in Rouquier blocks with p-weight w < p have complexity w.
When p is odd, D^{(p+1,1^{p-1})} has complexity 1.
Other simple modules with p-weight 2 have complexity 2.
Abstract
We show that the simple modules of the Rouquier blocks of symmetric groups, in characteristic and having -weight with , have a common complexity , and that when is odd, has complexity 1, while the other simple modules labelled by a partition having -weight 2 have complexity 2.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
