Proof of the Newell-Littlewood saturation conjecture

2024/08/30 by Jaewon Min, Min, Jaewon
Computer Science · Mathematics · Physics and Astronomy · #Advanced Mathematical Modeling in Engineering #Combinatorics (math.CO) #FOS: Mathematics #Mathematical Analysis and Transform Methods #Model Reduction and Neural Networks #Representation Theory (math.RT)

paper · pdf · doi:10.48550/arxiv.2409.00233

openalex publication_date 2024/08/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

By inventing the notion of honeycombs, A. Knutson and T. Tao proved the saturation conjecture for Littlewood-Richardson coefficients. The Newell-Littlewood numbers are a generalization of the Littlewood-Richardson coefficients. By introducing honeycombs on a Möbius strip, we prove the saturation conjecture for Newell-Littlewood numbers posed by S. Gao, G. Orelowitz and A. Yong.

Related

• The saturation conjecture (after A. Knutson and T. Tao)
• An Invitation to the Generalized Saturation Conjecture
• Saturation for Flagged Skew Littlewood-Richardson Coefficients
• A short geometric proof of a conjecture of Fulton
• The honeycomb model of GL(n) tensor products I: proof of the saturation conjecture