Bounds on Kronecker and $q$-binomial coefficients
Igor Pak, Greta Panova

TL;DR
This paper establishes new bounds on Kronecker and q-binomial coefficients, extending classical results and providing explicit estimates and asymptotic bounds for these combinatorial quantities.
Contribution
It introduces a lower bound on Kronecker coefficients using symmetric group characters and extends Sylvester's unimodality to derive sharp bounds on q-binomial coefficient differences.
Findings
Derived explicit estimates for Kronecker coefficients.
Extended Sylvester's unimodality to q-binomial coefficients.
Provided asymptotic lower bounds for a broader class of Kronecker coefficients.
Abstract
We present a lower bound on the Kronecker coefficients for tensor squares of the symmetric group via the characters of~, which we apply to obtain various explicit estimates. Notably, we extend Sylvester's unimodality of -binomial coefficients as polynomials in~ to derive sharp bounds on the differences of their consecutive coefficients. We then derive effective asymptotic lower bounds for a wider class of Kronecker coefficients.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Advanced Mathematical Identities · Coding theory and cryptography
