Fast computation of the partition function
From MaRDI portal
Publication:266631
DOI10.1016/j.jnt.2016.01.017zbMath1333.05031OpenAlexW2292915290MaRDI QIDQ266631
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
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
This page was built for publication: Fast computation of the partition function