Abstract
Let p(n,m) denote the number of partitions of n into exactly m parts. In this paper we uncover new congruences for the function p(n,m) and give an alternate proof to a known theorem in addition to extending it. The methods of proof rely on identifying generating functions to polynomials and then using the symmetric properties of those polynomials. The theorems proved here provide further motivation and description for a full characterisation of Ramanujan-like divisibility statements about the partition numbers p(n,m).
| Original language | English |
|---|---|
| Pages (from-to) | 735–747 |
| Number of pages | 13 |
| Journal | Annals of Combinatorics |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| Publication status | Published - Mar 2014 |
Fields of science
- 101 Mathematics
- 101001 Algebra
- 101005 Computer algebra
- 101009 Geometry
- 101012 Combinatorics
- 101013 Mathematical logic
- 101020 Technical mathematics
JKU Focus areas
- Computation in Informatics and Mathematics