A-‘nice’-bijection-for-a-content-formula-for-skew-semistandard-Young-tableaux.pdfVIP

A ‘nice’ bijection for a content formula for skew semistandard Young tableaux Martin Rubey Institut f¨ur Mathematik Universit¨at Wien http://www.univie.ac.at/~rubey a9104910@unet.univie.ac.at Submitted: May 31, 2001; Accepted: April 14, 2002. MR Subject Classifications: 05E10 Abstract Based on Sch¨utzenberger’s evacuation and a modification of jeu de taquin, we give a bijective proof of an identity connecting the generating function of reverse semistandard Young tableaux with bounded entries with the generating function of all semistandard Young tableaux. This solves Exercise 7.102 b of Richard Stanley’s book ‘Enumerative Combinatorics 2’. 1 Introduction The purpose of this article is to present a solution for Exercise 7.102 b of Richard Stanley’s book ‘Enumerative Combinatorics 2’ [5]. There, Stanley asked for a ‘nice’ bijective proof of the identity qn(R) = qn(P ) (1 − qa+c(ρ)), (1) R reverse SSYT P SSYT ρ∈λ/µ of shape λ/µ of shape λ/µ with Rij ≤ a + µi − i where a is an arbitrary integer such that a + c(ρ) 0 for all cells ρ ∈ λ/µ.1 Here, and in the sequel, we use notation defined below: Definition 1.1. A partition is a sequence λ = (λ , λ , . . . , λ ) with λ ≥ λ ≥ ≥ λ 1 2 r 1 2 r 0, for some r . 1In fact, this is the corrected versi