Bijections for an identity of Young Tableaux

2010/02/22 by Regev, Amitai, Zeilberger, Doron
#Combinatorics (math.CO) #FOS: Mathematics #Representation Theory (math.RT)

paper · doi:10.48550/arxiv.1002.4146

Abstract

We present an elegant bijection between standard Young tableaux with 2n cells and at most two rows, and pairs of standard Young tableaux of the same shape, with n+1 cells, where only the top row can have more than one cell.

Related

• Reductions of Young tableau bijections
• A `nice' bijection for a content formula for skew semistandard Young tableaux
• A probabilistic approach for enumeration of certain Young tableaux
• Enumeration formulas for Young tableaux in a diagonal strip
• Combinatorics for Certain Skew Young Tableaux, Dyck Paths, Triangulations, and Dissections