200
Views
53
CrossRef citations to date
0
Altmetric
Original Articles

Fast algorithms for genegrating integer partitions

&
Pages 319-332 | Received 28 Jan 1998, Published online: 19 Mar 2007
 

Abstract

We present two new algorithms for generating integer partitions in the standard representation. They generate partitions in lexicographic and anti-lexicographic order, respectively. We prove that both algorithm generate partitions with constant average delay, exclusive of the output. These are the first known algorithms to produce partitions in the standard representation and with constant average delay. The performance of all known integer partition algorithms-is measured and compared, separately for the standard and multiplicity representation. An empirical test shows that both new algorithms are several times faster than any of previously known algorithms for generating unrestricted integer partitions in the standard representation. Moreover, they are faster than any known algorithm for generating integer partition in the multiplicity representation (exclusive of the output).

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.