English

Finding Modular Functions for Ramanujan-Type Identities

Number Theory 2019-11-19 v1 Combinatorics

Abstract

This paper is concerned with a class of partition functions a(n)a(n) 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 a(mn+t)a(mn+t). While this algorithm is not guaranteed to succeed, it applies to many cases. For example, we deduce a witness identity for p(11n+6)p(11n+6) with integer coefficients. Our algorithm also leads to Ramanujan-type identities for the overpartition functions p(5n+2)\overline{p}(5n+2) and p(5n+3)\overline{p}(5n+3) and Andrews--Paule's broken 22-diamond partition functions 2(25n+14)\triangle_{2}(25n+14) and 2(25n+24)\triangle_{2}(25n+24). 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 functions Q3,1(9n+3)\overline{Q}_{3,1}(9n+3) and Q3,1(9n+6) \overline{Q}_{3,1}(9n+6) due to Shen, the 22-dissection formulas of Ramanujan and the 88-dissection formulas due to Hirschhorn.

Keywords

Cite

@article{arxiv.1911.07148,
  title  = {Finding Modular Functions for Ramanujan-Type Identities},
  author = {William Y. C. Chen and Julia Q. D. Du and Jack C. D. Zhao},
  journal= {arXiv preprint arXiv:1911.07148},
  year   = {2019}
}

Comments

45 pages, to appear in Annals of Combinatorics

R2 v1 2026-06-23T12:18:11.073Z