Kronecker coefficients for one hook shape

Abstract

We give a positive combinatorial formula for the Kronecker coefficient g_{lambda mu(d) nu} for any partitions lambda, nu of n and hook shape mu(d) := (n-d,1^d). Our main tool is Haiman's \emph{mixed insertion}. This is a generalization of Schensted insertion to \emph{colored words}, words in the alphabet of barred letters \bar{1},\bar{2},... and unbarred letters 1,2,.... We define the set of \emph{colored Yamanouchi tableaux of content lambda and total color d} (CYT_{lambda, d}) to be the set of mixed insertion tableaux of colored words w with exactly d barred letters and such that w^{blft} is a Yamanouchi word of content lambda, where w^{blft} is the ordinary word formed from w by shuffling its barred letters to the left and then removing their bars. We prove that g_{lambda mu(d) nu} is equal to the number of CYT_{lambda, d} of shape nu with unbarred southwest corner.

37 pages, 3 figures

Cited by in corpus (11)

• Hopf Algebras in Combinatorics
• On vanishing of Kronecker coefficients
• On the complexity of computing Kronecker coefficients
• Unifying and generalizing known lower bounds via geometric complexity theory
• Invariant Operators, Orthogonal Bases and Correlators in General Tensor Models
• Tensor and Matrix models: a one-night stand or a lifetime romance?
• Kronecker products, characters, partitions, and the tensor square conjectures
• Permanent versus determinant, obstructions, and Kronecker coefficients
• Products of characters of the symmetric group
• Unimodality via Kronecker products
• Rules of Three for commutation relations