Efficient computation of the overpartition function and applications (Q6115647)
From MaRDI portal
scientific article; zbMATH DE number 7725211
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient computation of the overpartition function and applications |
scientific article; zbMATH DE number 7725211 |
Statements
Efficient computation of the overpartition function and applications (English)
0 references
10 August 2023
0 references
The main goal of this article is to give an efficient algorithm for computing the number of overpartitions of \(n\), analogous to the one given by \textit{F. Johansson} [LMS J. Comput. Math. 15, 341--359 (2012; Zbl 1344.11089)] for the number of partition of \(n\). In this context, the authors find many new Ramanujan-style congruences.
0 references
overpartitions
0 references
Hardy-Ramanujan-Rademacher
0 references
congruences
0 references