Restricted partitions

Rafael Jakimczuk

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

Abstract:

We prove a known partitions theorem by Bell in an elementary and constructive way. Our proof yields a simple recursive method to compute the corresponding Sylvester polynomials for the partition. The previous known methods to obtain these polynomials are in general not elementary.

Date: 2004
References: Add references at CitEc
Citations: Track citations by RSS feed

Downloads: (external link)
http://downloads.hindawi.com/journals/IJMMS/2004/704694.pdf (application/pdf)
http://downloads.hindawi.com/journals/IJMMS/2004/704694.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:704694

DOI: 10.1155/S0161171204306502

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 ().