A bijective enumeration of $3$-strip tableaux
Combinatorics
2015-05-26 v2
Abstract
Baryshnikov and Romik derived the combinatorial identities for the numbers of the -strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the enumeration of -strip tableaux. In this paper we will provide such a bijective proof. First we count the -strip tableaux by decomposition. Secondly we will apply this "decomposition" idea on the up-down permutations and down-up permutations to enumerate the -strip tableaux bijectively.
Keywords
Cite
@article{arxiv.1504.06894,
title = {A bijective enumeration of $3$-strip tableaux},
author = {Emma Yu Jin},
journal= {arXiv preprint arXiv:1504.06894},
year = {2015}
}
Comments
14 pages