On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm (Q2229716): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by the same user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jsc.2020.05.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JSC.2020.05.003 / rank | |||
Normal rank | |||
Latest revision as of 14:19, 17 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm |
scientific article |
Statements
On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: an implementation of Radu's algorithm (English)
0 references
18 February 2021
0 references
The certain results from the theory of Riemann surfaces can be used to check the equality of two given modular functions by checking the equality of only a finite number of coefficients. Considering this fact, \textit{C.-S. Radu} [J. Symb. Comput. 68, Part 1, 225--253 (2015; Zbl 1356.11072)] designed an algorithm to detect identities of a class studied by Ramanujan and later by Kolberg. In this paper, the author provide an implementation of this algorithm using Mathematica.
0 references
partition congruences
0 references
partition identities
0 references
modular functions
0 references
Riemann surface
0 references
0 references
