Fast computation of the partition function

DOI10.1016/j.jnt.2016.01.017zbMath1333.05031OpenAlexW2292915290MaRDI QIDQ266631

Mircea Merca

Publication date: 13 April 2016

Published in: Journal of Number Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jnt.2016.01.017

zbMATH Keywords

partition functionrecurrence relationinteger partitions

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Combinatorial aspects of partitions of integers (05A17) Elementary theory of partitions (11P81) Analytic theory of partitions (11P82)

Related Items (7)

Parity of sums of partition numbers and squares in arithmetic progressions ⋮ New combinatorial interpretations for the partitions into odd parts greater than one ⋮ New recurrences for Eulers partition function ⋮ Recurrence relation for computing a bipartition function ⋮ On certain unimodal sequences and strict partitions ⋮ On identities of Watson type ⋮ On relations for the partitions of numbers

Cites Work

• Recurrences for the partition function and its relatives
• Efficient implementation of the Hardy–Ramanujan–Rademacher formula
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fast computation of the partition function