Andrews has established a refinement of the generating function for partitions π according to the numbers r(π) and s(π) of odd parts in π and the conjugate of π, respectively. In this paper, we derive a refined generating function for partitions into at most M parts less than or equal to N, which is a finite case of Andrew's refinement.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics