Finding Modular Functions for Ramanujan-Type Identities
William Y.C. Chen, Julia Q.D. Du, Jack C.D. Zhao

TL;DR
This paper develops an algorithm to find Ramanujan-type identities for a class of partition functions defined by eta-quotients, successfully deriving identities for various overpartition and broken partition functions.
Contribution
It introduces a new algorithm based on transformation laws and Radu's methods to discover Ramanujan-type identities for complex partition functions.
Findings
Derived identities for overpartition functions n+2 and n+3.
Established identities for broken 2-diamond partition functions.
Extended the method to general classes of partition functions.
Abstract
This paper is concerned with a class of partition functions introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radu's algorithms, we present an algorithm to find Ramanujan-type identities for . While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions and and Andrews--Paule's broken -diamond partition functions and . It can also be extended to derive Ramanujan-type identities on a more general class of partition functions. For example, it yields the Ramanujan-type identities on Andrews' singular overpartition…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Mathematical Identities · Analytic Number Theory Research · Advanced Combinatorial Mathematics
