Estimating and computing Kronecker Coefficients: a vector partition function approach

Abstract

We study the Kronecker coefficients gλ, μ, via a formula that was described by Mishna, Rosas, and Sundaram, in which the coefficients are expressed as a signed sum of vector partition function evaluations. In particular, we use this formula to determine formulas to evaluate, bound, and estimate gλ, μ, in terms of the lengths of the partitions λ, μ, and . We describe a computational tool to compute Kronecker coefficients gλ, μ, with (μ) ≤ 2,\ () ≤ 4,\ (λ) ≤ 8. We present a set of new vanishing conditions for the Kronecker coefficients by relating to the vanishing of the related atomic Kronecker coefficients, themselves given by a single vector partition function evaluation. We give a stable face of the Kronecker polyhedron for any positive integers m,n. Finally, we give upper bounds on both the atomic Kronecker coefficients and Kronecker coefficients.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…