2000 character limit reached
Bounds on the Kronecker coefficients
Published 11 Jun 2014 in math.CO and math.RT | (1406.2988v2)
Abstract: We present several upper and lower bounds on the Kronecker coefficients of the symmetric group. We prove $k$-stability of the Kronecker coefficients generalizing the (usual) stability, and giving a new upper bound. We prove a lower bound via the characters of $S_n$. We apply these and other results to generalize Sylvester's unimodality of the $q$-binomial coefficients $\binom{n}{k}_q$ as polynomials in $q$: we derive explicit sharp bounds on the differences of their consecutive coefficients.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.