Bijective proofs using two-line matrix representations for partitions (Q618858)

\textit{J. P. O. Santos}, \textit{P. Mondek} and \textit{A. C. Ribeiro} [``New two-line arrays representing partitions,'' Ann. Comb. 15, No.\,2, 341--354 (2011)] introduced new ways of representing partitions by two-line matrices. These results motivated the authors of the paper under review to present bijective proofs not only for the motivating relations but for various other identities. \textit{G. E. Andrews} [Indian J. Math. 42, No. 1, 1--7 (2000; Zbl 1034.05049)] presented the three-quadrant Ferrers graphs of a positive integer \(n\) by placing \(n\) points in the first, second and fourth quadrants of the plane so that each point must have at least one positive coordinate, further the points on the \(x\)-axis and on the \(y\)-axis form the longest row and the tallest column of positive \(x\)-coordinates and \(y\)-coordinates, respectively. In Section 3 of the paper under review the authors construct a bijection between the set of self-conjugate three-quadrant Ferrers graphs of \(n\) and the set \(\mathcal Q_n\) of partitions of \(n\) such that the odd parts are distinct and greater than 1. Let \(\mathcal R_n\) denote the set of partitions of \(n\) such that the odd parts are distinct, at least one odd part is contained and the largest odd part plus 1 exceeds any even part. In Section 4 the authors prove partition identities and establish bijections between several classes of partitions related to these identities. Their result that \(|\mathcal Q_n|-|\mathcal R_n|= (-1)^n\) resembles Euler's pentagonal number theorem. As an application of their combinatorially proved results, the authors obtain a straightforward proof of an identity about Ramanujan's function \(\sum^\infty_{n=0} q^{(n(n+1)/2}\). In Sections 5 and 6 a new bijective proof is presented for the Lebesgue identity.