2015/04/26 by Emma Yu Jin, Jin, Emma Yu
Engineering · Mathematics · #05A15 #05A19 #Advanced Combinatorial Mathematics #Advanced Mathematical Identities #Combinatorics (math.CO) #FOS: Mathematics #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.1504.06894
openalex publication_date 2015/04/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Baryshnikov and Romik derived the combinatorial identities for the numbers of the m-strip tableaux. This generalized the classical André's theorem for the number of up-down permutations. They asked for a bijective proof for the enumeration of 3-strip tableaux. In this paper we will provide such a bijective proof. First we count the 3-strip tableaux by decomposition. Secondly we will apply this "decomposition" idea on the up-down permutations and down-up permutations to enumerate the 3-strip tableaux bijectively.