The complexity of certain Specht modules for the symmetric group

Mathematics – Representation Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

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 $\lambda$ is built out of $p \times p$ 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 $p$-weight of partitions and branching.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

The complexity of certain Specht modules for the symmetric group does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The complexity of certain Specht modules for the symmetric group, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The complexity of certain Specht modules for the symmetric group will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-163377

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.