On the Limiting Vacillating Tableaux for Integer Sequences

Abstract: A fundamental identity in the representation theory of the partition algeba is

n^{k} = s u m_{l a m b d a} f^{l} a m b d a m_{k}^{l} a m b d a

for

n g e q 2 k

, where

l a m b d a

ranges over integer partitions of

n

,

f^{l} a m b d a

is the number of standard Young tableaux of shape

l a m b d a

, and

m_{k}^{l} a m b d a

is the number of vacillating tableaux of shape

l a m b d a

and length

2 k

. Using a combination of RSK insertion and jeu de taquin, Halverson and Lewandowski constructed a bijection

D I_{n}^{k}

that maps each integer sequence in

[n]^{k}

to a pair consisting of a standard Young tableau and a vacillating tableau. In this paper, we show that for a given integer sequence

, when

n

is sufficiently large, the vacillating tableaux determined by

become stable when

n i g h t a r r o w i n f t y

; the limit is called the limiting vacillating tableau for

. We give a characterization of the set of limiting vacillating tableaux and presents explicit formulas that enumerate those vacillating tableaux.

This page was built for publication: On the Limiting Vacillating Tableaux for Integer Sequences