On the computation of identities relating partition numbers in arithmetic progressions with eta quotients: An implementation of Radu's algorithm. (May 2021)

• Record Type: Journal Article
• Authors: Smoot, Nicolas Allen
• Is Part Of: Journal of symbolic computation. Volume 104(2021)
• Page Start: 276
• Page End: 311
• Publication Date: 2021-05
• Subjects: primary 11P83 -- secondary 11Y16; Partition congruences -- Partition identities -- Modular functions -- Riemann surface; Mathematics -- Data processing -- Periodicals; Numerical analysis -- Data processing -- Periodicals; Automatic programming (Computer science) -- Periodicals; Mathématiques -- Informatique -- Périodiques; Analyse numérique -- Informatique -- Périodiques; Programmation automatique -- Périodiques; Automatic programming (Computer science); Mathematics -- Data processing; Numerical analysis -- Data processing; Periodicals; Electronic journals; 510.285
• DOI: 10.1016/j.jsc.2020.05.003
• Languages: English
• ISSNs: 0747-7171

Abstract

Abstract: In 2015 Cristian-Silviu Radu designed an algorithm to detect identities of a class studied by Ramanujan and Kolberg, in which the generating functions of a partition function over a given set of arithmetic progressions are expressed in terms of Dedekind eta quotients over a given congruence subgroup. These identities include the famous results by Ramanujan which provide a witness to the divisibility properties of p ( 5 n + 4 ), p ( 7 n + 5 ) . We give an implementation of this algorithm using Mathematica. The basic theory is first described, and an outline of the algorithm is briefly given, in order to describe the functionality and utility of our package. We thereafter give multiple examples of applications to recent work in partition theory. In many cases we have used our package to derive alternate proofs of various identities or congruences; in other cases we have improved previously established identities.