On a nonlinear relation for computing the overpartition function

DOI10.1515/MS-2021-0002MaRDI QIDQ2054648zbMATH OpenOpenAlexFDO

Authors Mircea Merca

Publication date 3 December 2021

Published in Mathematica Slovaca (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2009.06597

zbMATH Keywords

algorithmsoverpartitionspartitionsrecurrences

Mathematics Subject Classification ID

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

Abstract: In 1939, H. S. Zuckerman provided a Hardy-Ramanujan-Rademacher-type convergent series that can be used to compute an isolated value of the overpartition function $overlinep(n)$. Computing $overlinep(n)$ by this method requires arithmetic with very high-precision approximate real numbers and it is complicated. In this paper, we provide a formula to compute the values of $overlinep(n)$ that requires only the values of $overlinep(k)$ with $kleqslantn/2$. This formula is combined with a known linear homogeneous recurrence relation for the overpartition function $overlinep(n)$ to obtain a simple and fast computation of the value of $overlinep(n)$. This new method uses only (large) integer arithmetic and it is simpler to program.

Recommendations

• Fast computation of the partition function
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• Computations of the partition function
• scientific article; zbMATH DE number 2076557
• scientific article; zbMATH DE number 2190090

Cites work

• \(q\)-identities related to overpartitions and divisor functions
• q-Pell sequences and two identities of V. A. Lebesgue
• A local limit theorem in the theory of overpartitions
• A Rademacher type formula for partitions and overpartitions
• A short note on the overpartition function
• A THEOREM ON SEVEN-COLORED OVERPARTITIONS AND ITS APPLICATIONS
• A truncated theta identity of Gauss and overpartitions into odd parts
• Arithmetic properties of overpartitions into odd parts
• Dyson's Rank, Overpartitions, and Weak Maass Forms
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• From a Rogers's identity to overpartitions
• Gordon's theorem for overpartitions.
• scientific article; zbMATH DE number 2126631 (Why is no real title available?)
• scientific article; zbMATH DE number 2190090 (Why is no real title available?)
• Jagged partitions
• Multiplicity and number of parts in overpartitions
• On pairs of partitions with steadily decreasing parts
• On the Arithmetic Mean of the Square Roots of the First n Positive Integers
• On the number of overpartitions into odd parts
• Overpartition Theorems of the Rogers–Ramanujan Type
• Overpartitions
• Overpartitions and real quadratic fields
• Overpartitions, lattice paths, and Rogers-Ramanujan identities
• Partitions and overpartitions with attached parts
• Rank and conjugation for the Frobenius representation of an overpartition
• Singular overpartitions
• The Gaussian coefficients and overpartitions
• The overpartition function modulo small powers of 2

Cited in

(7)

• Investigation of norms of overpartitions
• On the Ramanujan-type congruences modulo 8 for the overpartitions into odd parts
• Efficient implementation of the Hardy-Ramanujan-Rademacher formula
• Distinct partitions and overpartitions
• Efficient computation of the overpartition function and applications
• Overpartitions in terms of 2-adic valuation
• Linear dependencies among cubic partition numbers

This page was built for publication: On a nonlinear relation for computing the overpartition function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2054648)