The Littlewood-Richardson rule and Gelfand-Tsetlin patterns
Patrick Doolan, Sangjib Kim
TL;DR
This paper surveys the Littlewood-Richardson rule, emphasizing Gelfand-Tsetlin patterns to analyze and connect various combinatorial descriptions of the rule, enhancing understanding of its structure.
Contribution
It provides a comprehensive analysis of the Littlewood-Richardson rule using Gelfand-Tsetlin patterns, clarifying the relationships among different combinatorial models.
Findings
Gelfand-Tsetlin patterns effectively illustrate the Littlewood-Richardson rule.
Connections among various combinatorial descriptions are systematically analyzed.
The survey clarifies the structural relationships in the combinatorial representation of the rule.
Abstract
We give a survey on the Littlewood-Richardson rule. Using Gelfand-Tsetlin patterns as the main machinery of our analysis, we study the interrelationship of various combinatorial descriptions of the Littlewood-Richardson rule.
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 · Algebraic structures and combinatorial models