An algorithmic Littlewood-Richardson rule

2008/12/02 by Liu, Ricky Ini
#Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.0812.0435

Abstract

We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule presented by Coskun. We also present a corollary regarding the Specht modules of the intermediate diagrams.

Related

• The Littlewood-Richardson rule and Gelfand-Tsetlin patterns
• The Littlewood-Richardson rule, and related combinatorics
• A geometric Littlewood-Richardson rule
• Equivariant Littlewood-Richardson Skew Tableaux
• The odd Littlewood-Richardson rule