Combinatorial proofs of Ramanujan's \(_{1} \psi_{1}\) summation and the \(q\)-Gauss summation. (Q1427009): Difference between revisions

For a nonnegative integer \(n\), a Frobenius partition of \(n\) is a two-rowed array (say, with first row \(a_1,\dots,a_r\) and second row \(b_1, \dots,b_r\) of row-wise distinct nonnegative integers where each row is of the same length, each arranged in decreasing order, and \(n=r+ \sum^r_{i=1}(a_i+b_i)\). Andrews generalized this idea to the theory of partitions giving various restrictions on integers in two-rowed arrays (these kinds of partitions are called the \(F\)-partitions). In this paper, the author gives combinatorial proofs (by using the \(F\)-partitions) of the well-known Ramanujan's \(_1\psi_1\) summation and the \(q\)-Gauss summation.