Combinatorial proofs are given for certain entries in Ramanujan's lost notebook. Bijections of Sylvester, Franklin, and Wright, and applications of Algorithm Z of Zeilberger are employed. A new bijection, involving the new concept of the parity sequence of a partition, is used to prove one of Ramanujan's fascinating identities for a partial theta function.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics