Homomorphisms from an arbitrary Specht module to one corresponding to a hook (Q2357512): Difference between revisions

In the representation theory of symmetric groups (and more generally Iwahori-Hecke algebras of type A), the Specht modules play a key role, and it is an important problem to find the space of homomorphisms between two given Specht modules. Various special cases of this problem have been solved in the literature, and the objective here is to solve another special case, where one of the partitions labelling the Specht modules is a hook partition (and the other is arbitrary). The author gives a complete solution (at least when the quantum characteristic is not \(2\)): the dimension of the space of homomorphisms is at most \(1\), and precise conditions on the labelling partitions are given to decide whether it is \(0\) or \(1\). The method of proof is to use the Brundan-Kleshchev theorem [\textit{J. Brundan} and \textit{A. Kleshchev}, Invent. Math. 178, No. 3, 451--484 (2009; Zbl 1201.20004)] that the Hecke algebras in question are isomorphic to cyclotomic KLR algebras, which have a very nice presentation by generators and relations. The theory of Specht modules for these algebras has been developed by \textit{J. Brundan} et al. [J. Reine Angew. Math. 655, 61--87 (2011; Zbl 1244.20003)] and then by \textit{A. S. Kleshchev} et al. [Proc. Lond. Math. Soc. (3) 105, No. 6, 1245--1289 (2012; Zbl 1268.20007)] so that each Specht module has a presentation with a single generator and a reasonably nice set of relations, and also a standard basis with nice properties. The strategy of the proof is then straightforward: to classify homomorphisms \(\text{S}^\lambda\to\text{S}^\mu\), one looks for all possible linear combinations of the standard basis elements for \(\text{S}^\mu\) satisfying the defining relations for the standard generator of \(\text{S}^\lambda\). This is done in a very tidy way in the paper under review, at least until the Garnir relations come into play, at which point calculations with braid diagrams have to be performed. Some examples are given at the end. The paper is very well written and (despite the calculations) pleasant to read.