A bijective proof of an identity of Berkovich and Uncu
Abstract
The BG-rank BG(π) of an integer partition π is defined as BG(π) := i-j where i is the number of odd-indexed odd parts and j 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 B2N+(k,q)=q2k2-k[matrix2N+\+kmatrix]q2 for any integer k and non-negative integer N where ∈ \0,1\, BN(k,q) is the generating function for partitions into distinct parts less than or equal to N with BG-rank equal to k and [matrixa+b\matrix]q 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.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.