Upper bounds on Kronecker coefficients with few rows

2020/02/25 by Igor Pak, Greta Panova, Pak, Igor +1 · 1 citation
Mathematics · #Advanced Combinatorial Mathematics #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Limits and Structures in Graph Theory #Representation Theory (math.RT)

paper · pdf · doi:10.48550/arxiv.2002.10956

openalex publication_date 2020/02/25 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We present three different upper bounds for Kronecker coefficients g(λ,μ,ν) in terms of Kostka numbers, contingency tables and Littlewood--Richardson coefficients. We then give various examples, asymptotic applications, and compare them with existing lower bounds.

Cited by

• Breaking down the reduced Kronecker coefficients

Related

• On the largest Kronecker and Littlewood--Richardson coefficients
• Estimating and computing Kronecker Coefficients: a vector partition function approach
• On the complexity of computing Kronecker coefficients
• Breaking down the reduced Kronecker coefficients
• Kronecker Coefficients For Some Near-Rectangular Partitions