Product partitions and recursion formulae

M. V. Subbarao

International Journal of Mathematics and Mathematical Sciences, 2004, vol. 2004, 1-11

Abstract:

Utilizing a method briefly hinted in the author's paper written in 1991 jointly with V. C. Harris, we derive here a number of unpublished recursion formulae for a variety of product partition functions which we believe have not been considered before in the literature. These include the functions p * ( n ; k , h ) (which stands for the number of product partitions of n > 1 into k parts of which h are distinct), and p ( d ) * ( n ; m ) (which stands for the number of product partitions of n into exactly m parts with at most d repetitions of any part). We also derive recursion formulae for certain product partition functions without the use of generating functions.

Date: 2004
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/841457.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/841457.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jijmms:841457

DOI: 10.1155/S0161171204307258

Access Statistics for this article

More articles in International Journal of Mathematics and Mathematical Sciences from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().