Zum Hauptinhalt springen
Artikel
Lizenziert
Nicht lizenziert Erfordert eine Authentifizierung

A Combinatorial Proof of a Recursive Formula for Multipartitions

  • EMAIL logo und
Veröffentlicht/Copyright: 24. Januar 2012
Veröffentlichen auch Sie bei De Gruyter Brill
Integers
Aus der Zeitschrift Band 12 Heft 1

Abstract.

For k1, let pk(n) count the number of k-component multipartitions of a nonnegative integer n, and let σ(n)=dnd be the usual divisor function. In this paper, we give a combinatorial proof of the recursive formula

pk(n)=knr=1npk(n-r)σ(r),

both for k1, where pk(n) is defined as above, and also for k<0, which requires a subtler approach. This formula was used by Gandhi in 1963 to prove several theorems, which yield numerous Ramanujan type congruences for pk(n), including some well-known congruences for Ramanujan's τ-function.

Received: 2011-04-27
Revised: 2011-06-25
Accepted: 2011-08-22
Published Online: 2012-01-24
Published in Print: 2012-February

© 2012 by Walter de Gruyter Berlin Boston

Heruntergeladen am 29.4.2026 von https://www.degruyterbrill.com/document/doi/10.1515/integ.2011.089/html?lang=de
Button zum nach oben scrollen