English
Related papers

Related papers: Finding Modular Functions for Ramanujan-Type Ident…

200 papers

Let $p_{-t}(n)$ denote the number of partitions of $n$ into $t$ colors. In analogy with Ramanujan's work on the partition function, Lin recently proved in \cite{Lin} that $p_{-3}(11n+7)\equiv0\pmod{11}$ for every integer $n$. Such…

Number Theory · Mathematics 2022-06-22 Madeline Locus , Ian Wagner

Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23…

Number Theory · Mathematics 2022-12-21 Cristina Ballantine , Mircea Merca , Cristian-Silviu Radu

Ramanujan (and others) proved that the partition function satisfies a number of striking congruences modulo powers of 5, 7 and 11. A number of further congruences were shown by the works of Atkin, O'Brien, and Newman. In this paper we prove…

Number Theory · Mathematics 2007-05-23 Ken Ono

Let $\overline{p}(n)$ denote the number of overpartitions of $n$. Recently, Fortin-Jacob-Mathieu and Hirschhorn-Sellers independently obtained 2-, 3- and 4-dissections of the generating function for $\overline{p}(n)$ and derived a number of…

Combinatorics · Mathematics 2014-08-08 William Y. C. Chen , Qing-Hu Hou , Lisa H. Sun , Li Zhang

We construct a family of partition identities which contain the following identities: Rogers-Ramanujan-Gordon identities, Bressoud's even moduli generalization of them, and their counterparts for overpartitions due to Lovejoy et al. and…

Combinatorics · Mathematics 2014-09-19 Kağan Kurşungöz

This paper has a two-fold purpose. First, by considering a reformulation of a deep theorem of G\"ollnitz, we obtain a new weighted partition identity involving the Rogers-Ramanujan partitions, namely, partitions into parts differing by at…

Combinatorics · Mathematics 2007-05-23 Krishnaswami Alladi , Alexander Berkovich

We prove a q-series identity that generalises Macdonald's A_{2n}^{(2)} eta-function identity and the Rogers-Ramanujan identities. We conjecture our result to generalise even further to also include the Andrews-Gordon identities.

Combinatorics · Mathematics 2012-02-28 S. Ole Warnaar , Wadim Zudilin

Recently, Andrews introduced separable integer partition classes and analyzed some well-known theorems. In this paper, we investigate partitions with parts separated by parity introduced by Andrews with the aid of separable integer…

Combinatorics · Mathematics 2023-10-30 Y. H. Chen , Thomas Y. He , F. Tang , J. J. Wei

Recently, Andrews and Paule introduced a partition function $PDN1(N)$ which denotes the number of partition diamonds with $(n+1)$ copies of $n$ where summing the parts at the links gives $N$. They also presented the generating function for…

Number Theory · Mathematics 2025-03-04 Julia Q. D. Du , Olivia X. M. Yao

Sang, Shi and Yee, in 2020, found overpartition analogs of Andrews' results involving parity in Rogers-Ramanujan-Gordon identities. Their result partially answered an open question of Andrews'. The open question was to involve parity in…

Combinatorics · Mathematics 2022-11-10 Kağan Kurşungöz , Mohammad Zadehdabbagh

This is a tutorial for using two new MAPLE packages, thetaids and ramarobinsids. The thetaids package is designed for proving generalized eta-product identities using the valence formula for modular functions. We show how this package can…

Number Theory · Mathematics 2018-07-24 Jie Frye , Frank Garvan

Let $f(q)$ denote Ramanujan's mock theta function \[f(q) = \sum_{n=0}^{\infty} a(n) q^{n} := 1+\sum_{n=1}^{\infty} \frac{q^{n^{2}}}{(1+q)^{2}(1+q^{2})^{2}\cdots(1+q^{n})^{2}}.\] It is known that there are many linear congruences for the…

Number Theory · Mathematics 2015-04-15 Nickolas Andersen

Ramanujan's congruence $p(5k+4) \equiv 0 \pmod 5$ led Dyson \cite{dyson} to conjecture the existence of a measure "rank" such that $p(5k+4)$ partitions of $5k+4$ could be divided into sub-classes with equal cardinality to give a direct…

Number Theory · Mathematics 2016-05-20 Rupam Barman , Archit Pal Singh Sachdeva

Let ${{\overline{p}}_{3}}(n)$ be the number of overpartition triples of $n$. By elementary series manipulations, we establish some congruences for ${\overline{p}}_{3}(n)$ modulo small powers of 2, such as…

Number Theory · Mathematics 2015-05-13 Liuquan Wang

In a handwritten manuscript published with his lost notebook, Ramanujan stated without proofs forty identities for the Rogers-Ramanujan functions. We observe that the functions that appear in Ramanujan's identities can be obtained from a…

Number Theory · Mathematics 2012-07-24 Alexander Berkovich , Hamza Yesilyurt

Congruences are found modulo powers of 5, 7 and 13 for Andrews' smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan's partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit…

Number Theory · Mathematics 2010-11-10 F. G. Garvan

For each $n\geq 1$, we express the partition function $p(n)$ as a CM trace on $X_0(6)$ of the discriminant $\Delta_n:=1-24n$ invariants of a weight 0 weak Maass function $P$ that records where CM elliptic curves sit on $X(1)$, together with…

Number Theory · Mathematics 2025-09-05 Ken Ono

We study certain arithmetic properties of an analogue $B(n)$ of Lin's restricted partition function that counts the number of partition triples $\pi=(\pi_1,\pi_2,\pi_3)$ of $n$ such that $\pi_1$ and $\pi_2$ comprise distinct odd parts and…

Number Theory · Mathematics 2026-04-10 Russelle Guadalupe

In 2017, Keith presented a comprehensive survey on integer partitions into parts that are simultaneously regular, distinct, and/or flat. Recently, the authors initiated a study of partitions into parts that are simultaneously regular and…

Number Theory · Mathematics 2025-06-10 Mohammed L. Nadji , Moussa Ahmia

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

Number Theory · Mathematics 2024-05-10 Dalen Dockery , Marie Jameson , James A. Sellers , Samuel Wilson