Puzzles, tableaux, and mosaics

13Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

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. © 2007 Springer Science+Business Media, LLC.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

Purbhoo, K. (2008). Puzzles, tableaux, and mosaics. Journal of Algebraic Combinatorics, 28(4), 461–480. https://doi.org/10.1007/s10801-007-0110-3

Readers' Seniority

Tooltip

Professor / Associate Prof. 4

57%

PhD / Post grad / Masters / Doc 2

29%

Researcher 1

14%

Readers' Discipline

Tooltip

Mathematics 6

75%

Medicine and Dentistry 1

13%

Physics and Astronomy 1

13%

Save time finding and organizing research with Mendeley

Sign up for free