On the Correspondence Between Integer Sequences and Vacillating Tableaux

A fundamental identity in the representation theory of the partition algebra is nᵏ = _ f^ mₖ^ for n 2k, where ranges over integer partitions of n, f^ is the number of standard Young tableaux of shape, and mₖ^ is the number of vacillating tableaux of shape and length 2k. Using a combination of RSK insertion and jeu de taquin, Halverson and Lewandowski constructed a bijection DIₙᵏ that maps each integer sequence in nᵏ to a pair of tableaux of the same shape, where one is a standard Young tableau and the other is a vacillating tableau. In this paper, we study the fine properties of Halverson and Lewandowski's bijection and explore the correspondence between integer sequences and the vacillating tableaux via the map DIₙᵏ for general integers n and k. In particular, we characterize the integer sequences i whose corresponding shape, , in the image DIₙᵏ (i), satisfies ₁ = n or ₁ = n-k.