A bijective proof of an identity of Berkovich and Uncu
arXiv:2309.07785
Abstract
The BG-rank BG() of an integer partition is defined as where is the number of odd-indexed odd parts and is the number of even-indexed odd parts of . In a recent work, Fu and Tang ask for a direct combinatorial proof of the following identity of Berkovich and Uncu for any integer and non-negative integer where , is the generating function for partitions into distinct parts less than or equal to with BG-rank equal to and is a Gaussian binomial coefficient. In this paper, we provide a bijective proof of Berkovich and Uncu's identity along the lines of Vandervelde and Fu and Tang's idea.
18 pages, 8 figures. To appear in Séminaire Lotharingien de Combinatoire