Puzzles, tableaux, and mosaics
Kevin Purbhoo
University of Waterloo 200 University Ave. W. Waterloo ON N2L 3G1 Canada
DOI: 10.1007/s10801-007-0110-3
Abstract
We define mosaics, which are naturally in bijection with Knutson-Tao puzzles. We define an operation on mosaics, which shows they are also in bijection with Littlewood-Richardson skew-tableaux. Another consequence of this construction is that we obtain bijective proofs of commutativity and associativity for the ring structures defined either of these objects. In particular, we obtain a new, easy proof of the Littlewood-Richardson rule. Finally we discuss how our operation is related to other known constructions, particularly jeu de taquin.
Pages: 461–480
Keywords: keywords Littlewood-Richardson rule; puzzles; jeu de taquin
Full Text: PDF
References
1. Benkart, G., Sottile, F., Stroomer, J.: Tableau switching: algorithms and applications. J. Comb. Theory A 76(1), 11-43 (1996)
2. Buch, A., Kresch, A., Tamvakis, H.: Littlewood-Richardson rules for Grassmannians. Adv. Math. 197(1), 306-320 (2005) J Algebr Comb (2008) 28: 461-480
2. Buch, A., Kresch, A., Tamvakis, H.: Littlewood-Richardson rules for Grassmannians. Adv. Math. 197(1), 306-320 (2005) J Algebr Comb (2008) 28: 461-480