Counting Partitions on the Abacus
| dc.creator | Wildon, Mark | |
| dc.date | 2006-09-06 | |
| dc.date.accessioned | 2026-07-07T07:24:34Z | |
| dc.date.available | 2026-07-07T07:24:34Z | |
| dc.description | In 2003, Maroti showed that one could use the machinery of l-cores and l-quotients of partitions to establish lower bounds for p(n), the number of partitions of n. In this paper we explore these ideas in the case l=2, using them to give a largely combinatorial proof of an effective upper bound on p(n), and to prove asymptotic formulae for the number of self-conjugate partitions, and the number of partitions with distinct parts. In a further application we give a combinatorial proof of an identity originally due to Gauss. | |
| dc.description | 11 pages, 1 figure | |
| dc.identifier | https://arxiv.org/abs/math/0609175 | |
| dc.identifier | http://arxiv.org/abs/math/0609175 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/116407 | |
| dc.subject | Combinatorics | |
| dc.subject | 05A17 | |
| dc.title | Counting Partitions on the Abacus | |
| dc.type | text |