An algorithm for semistandardising homomorphisms

Suppose $μ$ is a partition of $n$ and $λ$ a composition of $n$, and let $S^μ$, $M^λ$ 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ϕ_A:S^μ\to M^λ$ as a linear combination of semistandard homomorphisms. Along the way we provide a utility result related to removing rows from tableaux.

No reviews yet.

No comments yet.