A combinatorial proof of a Schmidt type theorem of Andrews and Paule (Q2121750)

Schmidt partitions were introduced in [\textit{F. Schmidt}, ``Problem 10629'', Am. Math. Mon. 104, No. 10, 974 (1997)]. They are similar to integer partitions with distinct parts, but with an unusual ``size'' parameter. It is showed there that, for each integer \(n\), \par i) the number of integer partitions of \(n\), \par ii) the number of Schmidt partitions of \(n\), \textit{i.e.}, partitions \(\lambda_1>\lambda_2>\cdots > \lambda_k\) (for some \(k\geq 0\)) such that \(\lambda_1+\lambda_3+\lambda_5+\cdots = n\), are equal. \textit{G. E. Andrews} and \textit{P. Paule} [J. Number Theory 234, 95--119 (2022; Zbl 1484.11201)] showed the following variant. For each integer \(n\), \par 1) the number of two-colored partitions of \(n\), \par 2) the number of Schmidt partitions of \(n\), \textit{i.e.}, partitions \(\lambda_1\geq \lambda_2\geq \cdots \geq \lambda_k\) (for some \(k\geq 0\)) such that \(\lambda_1+\lambda_3+\lambda_5+\cdots = n\), are equal. In the present note, the authors give a very natural bijective proof of the previous result, via some tools such as 2-modular diagrams, Sylvester's bijection, and Wright's bijection. The bijection also gives a refinement of the result by Andrews and Paule [loc. cit.].