A geometric approach to the stabilisation of certain sequences of Kronecker coefficients (Q1755532)

Let \(\mathfrak{S}_n\) be the symmetric group on \(n\) elements and let \(M_{\alpha}\) be its irreducible representation corresponding to the partition \(\alpha \vdash n\). One of the fundamental problems in algebraic combinatorics and representation theory is to explicitly describe the decomposition of the tensor product of two such irreducibles: \[ M_{\alpha}\otimes M_{\beta} = \bigoplus_{\gamma\vdash n} M_{\gamma}^{\oplus g_{\alpha, \beta, \gamma}}. \] The multiplicities \(g_{\alpha, \beta, \gamma}\) are non-negative integers called \textit{Kronecker coefficients}, the main focus of this article. \textit{F. D. Murnaghan} [Am. J. Math. 60, 761--784 (1938; JFM 64.0070.02)] noticed an interesting asymptotic property that Kronecker coefficients possess: let \(\alpha, \beta, \gamma\) be partitions of \(n\); if one repeatedly increases by one the first part of each of these partitions, the sequence of Kronecker coefficients stabilizes. More recently, \textit{J. R. Stembridge} [``Generalized stability of Kronecker coefficients'', Preprint, \url{http://www.math.lsa.umich.edu/ jrs/papers/kron.pdf}] introduced two useful notions of stability of a triple of partitions (Definition 1.1) and conjectured that they are in fact equivalent. In [J. Algebr. Comb. 43, No. 1, 1--10 (2016; Zbl 1345.05113)], \textit{S. V. Sam} and \textit{A. Snowden} proved this conjecture. In this paper, the author gives a new proof of this result (Theorem 1.2). The novelty is on the methods: the author's approach relies on geometric invariant theory. Indeed, Kronecker coefficients are related to dimensions of spaces of invariant global sections of some line bundles on a projective variety. With the same techniques, some known bounds on Kronecker coefficients are recovered as well. Moreover, interesting stability results for plethysm coefficients and for multiplicities of tensor products of two irreducible representations of the hyperoctahedral group are proven.