Abstract
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.
Original language | English (US) |
---|---|
Pages (from-to) | 313-321 |
Number of pages | 9 |
Journal | Journal of Combinatorial Theory. Series A |
Volume | 107 |
Issue number | 2 |
DOIs | |
State | Published - Aug 2004 |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics