A positive proof of the Littlewood-Richardson rule using the octahedron recurrence
Allen Knutson, Terence Tao, Christopher T. Woodward
Abstract
We define thehive ring, which has a basis indexed by dominant weights for GL(n), and structure constants given by counting hives [KT1] (or equivalently honeycombs, or Berenstein-Zelevinsky patterns [BZ1]). We use the octahedron rule from [Robbins-Rumsey,Fomin-Zelevinsky,Propp,Speyer] to prove bijectively that this "ring" is indeed associative. This, and the Pieri rule, give a self-contained proof that the hive ring is isomorphic as a ring-with-basis to the representation ring of GL(n). In the honeycomb interpretation, the octahedron rule becomes "scattering" of the honeycombs. This recovers some of the "crosses and wrenches" diagrams from the very recent preprint [S], whose results we use to give a closed form for the associativity bijection.
Create a lesson
Related papers
Fractional colorings of Kr-free graphs with local demands
Ewan Davies, Abhishek Dhawan, Abhishek Methuku et al.
Short permutation pattern waves: The complete length-five classification
Lihong Qiu, Minglei Mao, Yaping Mao
Automatic partition identities
Laurent Bartholdi
Well-Covered Powers: Cartesian Products and Cayley Graphs
Haobo Ma, Thanh Vu, Wenlin Zhang
Lemmas and Conjectures in Spectral Graph Theory
Tristan Cazenave
On the lower- and upper bounds of three-colored anti-Ramsey numbers
Máté Giesz