An algorithm for semistandardising homomorphisms. (Q1936126)

Let \(\mathcal H_n\) denote the Hecke algebra of type \(A\) defined over a field \(F\) with respect to a non-zero parameter \(q\in F\). When \(q=1\) this algebra becomes the usual symmetric group algebra \(FS_n\). Let \(S^\lambda\) and \(M^\lambda\) denote, respectively, the Specht module and the Young permutation module for \(\mathcal H_n\) corresponding to the partition \(\lambda\) of \(n\). For each row-standard \(\mu\)-tableau of type \(\lambda\), Dipper and James defined a homomorphism \(\widehat\varphi_A\colon S^\mu\to M^\lambda\), and showed that, when \(q\neq -1\), the homomorphisms \(\widehat\varphi_A\) when \(A\) is a semistandard tableau form a basis for \(\Hom_{\mathcal H_n}(S^\mu,M^\lambda)\). The main result of the paper under review is an algorithm that will express an arbitrary row-standard homomorphism as an \(F\)-linear combination of semistandard homomorphisms. Using the characterization of Specht modules given by the kernel-intersection theorem, this algorithm can be used to compute the space of \(\mathcal H_n\)-homomorphisms between two Specht modules when \(q\neq -1\). The author has implemented the algorithm as a GAP4 package. References are given to new results obtained using this algorithm.