An algorithm for semistandardising homomorphisms

Details An algorithm for semistandardising homomorphisms An algorithm for semistandardising homomorphisms

2011-09-21

arxiv.org/abs/1109.4522v1

Mathematics

Representation Theory

Scientific paper

Suppose $\mu$ is a partition of $n$ and $\lambda$ a composition of $n$, and let $S^\mu$, $M^\lambda$ denote the Specht module and permutation module defined by Dipper and James for the Iwahori--Hecke algebra $\mathscr{H}_n$ of the symmetric group $\mathfrak{S}_n$. We give an explicit fast algorithm for expressing a tableau homomorphism $\hat\phi_A:S^\mu\to M^\lambda$ as a linear combination of semistandard homomorphisms. Along the way we provide a utility result related to removing rows from tableaux.

Affiliated with

Also associated with

No associations

Rating

An algorithm for semistandardising homomorphisms 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 An algorithm for semistandardising homomorphisms, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An algorithm for semistandardising homomorphisms will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-257581