The complexity of certain Specht modules for the symmetric group.
From MaRDI portal
Publication:968231
DOI10.1007/S10801-009-0169-0zbMATH Open1191.20010arXiv0811.3544OpenAlexW2160258128MaRDI QIDQ968231FDOQ968231
Publication date: 5 May 2010
Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)
Abstract: During the 2004-2005 academic year the VIGRE algebra research group at the University of Georgia computed the complexities of certain Specht modules S^lambda for the symmetric group, using the computer algebra program Magma. The complexity of an indecomposable module does not exceed the p-rank of the defect group of its block. The Georgia group conjectured that, generically, the complexity of a Specht module attains this maximal value; that it is smaller precisely when the Young diagram of is built out of blocks. We prove one direction of this conjecture by showing these Specht modules do indeed have less than maximal complexity. It turns out that this class of partitions, which has not previously appeared in the literature, arises naturally as the solution to a question about the -weight of partitions and branching.
Full work available at URL: https://arxiv.org/abs/0811.3544
Recommendations
Combinatorial aspects of representation theory (05E10) Modular representations and characters (20C20) Representations of finite symmetric groups (20C30)
Cites Work
Cited In (6)
- On the complexities of some simple modules of symmetric groups
- Specht modules with Abelian vertices.
- The complexity of the Specht modules corresponding to hook partitions.
- The varieties for some Specht modules.
- A web basis of invariant polynomials from noncrossing partitions
- The Complexity of a Module and Elementary Abelian Subgroups: A Geometric Approach
This page was built for publication: The complexity of certain Specht modules for the symmetric group.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968231)