A Note on Statistical Averages for Oscillating Tableaux

Oscillating tableaux are certain walks in Young’s lattice of partitions; they generalize standard Young tableaux. The shape of an oscillating tableau is the last partition it visits and the length of an oscillating tableau is the number of steps it takes. We define a new statistic for oscillating tableaux that we call weight: the weight of an oscillating tableau is the sum of the sizes of all the partitions that it visits. We show that the average weight of all oscillating tableaux of shape λ and length |λ|+ 2n (where |λ| denotes the size of λ and n ∈ N) has a surprisingly simple formula: it is a quadratic polynomial in |λ| and n. Our proof via the theory of differential posets is largely computational. We suggest how the homomesy paradigm of Propp and Roby may lead to a more conceptual proof of this result and reveal a hidden symmetry in the set of perfect matchings.