English
Related papers

Related papers: Remarks on MacMahon's $q$-series

200 papers

In 1919, P. A. MacMahon studied generating functions for generalized divisor sums. In this paper, we provide a framework in which to view these generating functions in terms of Jacobi forms, and prove that they are quasi-modular forms.

Number Theory · Mathematics 2015-07-27 Simon Rose

A q-series with nonnegative power series coefficients is called positive. The partition statistics BG-rank is defined as an alternating sum of parities of parts of a partition. It is known that the generating function for the number of…

Number Theory · Mathematics 2007-09-16 Alexander Berkovich , Hamza Yesilyurt

In this paper, we extend the notion of labeled partitions with ordinary permutations to colored permutations in the sense that the colors are endowed with a cyclic structure. We use labeled partitions with colored permutations to derive the…

Combinatorics · Mathematics 2008-10-21 William Y. C. Chen , Henry Y. Gao , Jia He

We say a power series $a_0+a_1q+a_2q^2+\cdots$ is \emph{multiplicative} if $n\mapsto a_n/a_1$ for positive integers $n$ is a multiplicative function. Given the Eisenstein series $E_{2k}(q)$, we consider formal multiplicative power series…

Number Theory · Mathematics 2025-11-04 Boyuan Xiong

In this paper, first we introduce a quantity called a partition function for a quiver mutation sequence. The partition function is a generating function whose weight is a $q$-binomial associated with each mutation. Then, we show that the…

Mathematical Physics · Physics 2016-11-21 Akishi Kato , Yuma Mizuno , Yuji Terashima

An ordered partition of [n]:={1,2,..., n} is a sequence of its disjoint subsets whose union is [n]. The number of ordered partitions of [n] with k blocks is k!S(n,k), where S(n,k) is the Stirling number of second kind. In this paper we…

Combinatorics · Mathematics 2007-05-23 Masao Ishikawa , Anisse Kasraoui , Jiang Zeng

Inspired by a number of recent papers by Corteel, Dousse, Foda, Uncu and Welsh on cylindric partitions and Rogers-Ramanujan-type identities, we obtain the $\mathrm{A}_2$ (or $\mathrm{A}_2^{(1)}$) analogues of the celebrated Andrews-Gordon…

Combinatorics · Mathematics 2023-07-04 S. Ole Warnaar

The generating function of partitions with repeated (resp. distinct) parts such that each odd part is less than twice the smallest part is shown to be the third order mock theta function $\omega(q)$ (resp. $\nu(-q)$). Similar results for…

Number Theory · Mathematics 2015-03-16 George E. Andrews , Atul Dixit , Ae Ja Yee

We study statistics on ordered set partitions whose generating functions are related to $p,q$-Stirling numbers of the second kind. The main purpose of this paper is to provide bijective proofs of all the conjectures of \stein…

Combinatorics · Mathematics 2007-12-12 Anisse Kasraoui , Jiang Zeng

In this paper, we generalize Andrews' partitions separated by parity to overpartitions in two ways. We investigate the generating functions for 16 overpartition families whose parts are separated by parity, and we prove various $q$-series…

Number Theory · Mathematics 2026-01-14 Kathrin Bringmann , Catherine Cossaboom , William Craig

Since their introduction by Andrews, generalized Frobenius partitions have interested a number of authors, many of whom have worked out explicit formulas for their generating functions in specific cases. This has uncovered interesting…

Number Theory · Mathematics 2016-10-25 Kathrin Bringmann , Larry Rolen , Michael Woodbury

Inspired by Andrews' and Bachraoui's work on partitions with repeated smallest part, we extend the concept to overpartitions. We study overpartitions with the restriction that the smallest non-overlined part appears exactly $k$ times and…

Combinatorics · Mathematics 2026-03-31 Amita Malik , Rishabh Sarma

Let $\mathbb{F}_q$ be the finite field of $q=p^m\equiv 1\pmod 4$ elements with $p$ being an odd prime and $m$ being a positive integer. For $c, y \in\mathbb{F}_q$ with $y\in\mathbb{F}_q^*$ non-quartic, let $N_n(c)$ and $M_n(y)$ be the…

Number Theory · Mathematics 2021-08-03 Junyong Zhao , Yulu Feng , Shaofang Hong , Chaoxi Zhu

Recently, Merca and Schmidt found some decompositions for the partition function $p(n)$ in terms of the classical M\"{o}bius function as well as Euler's totient. In this paper, we define a counting function $T_k^r(m)$ on the set of…

Combinatorics · Mathematics 2024-09-04 Subhajit Bandyopadhyay , Nayandeep Deka Baruah

We give explicit expressions for MacMahon's generalized sums-of-divisors $q$-series $A_r$ and $C_r$ by relating them to (odd) multiple Eisenstein series. Recently, these sums-of-divisors have been studied in the context of quasimodular…

Number Theory · Mathematics 2023-12-12 Henrik Bachmann

Recently, Andrews, Dixit and Yee introduced partition functions associated with Ramanujan/Watson third order mock theta functions $\omega(q)$ and $\nu(q)$. In this paper, we find several new exact generating functions for those partition…

Number Theory · Mathematics 2023-01-30 Nayandeep Deka Baruah , Nilufar Mana Begum

We define an overpartition analogue of Gaussian polynomials (also known as $q$-binomial coefficients) as a generating function for the number of overpartitions fitting inside the $M \times N$ rectangle. We call these new polynomials over…

Combinatorics · Mathematics 2014-12-30 Jehanne Dousse , Byungchan Kim

In 1918, Hardy and Ramanujan published a seminal paper which included an asymptotic formula for the partition function. In their paper, they also claim without proof an asymptotic equivalence for $p^k(n)$, the number of partitions of a…

Number Theory · Mathematics 2015-06-22 Ayla Gafni

We give an alternative construction for a family of partition generating functions due to Kanade and Russell. In our alternative construction, we use ordinary partitions instead of jagged partitions. We also present new generating functions…

Combinatorics · Mathematics 2021-10-01 Kağan Kurşungöz , Halime Ömrüuzun Seyrek

In the $1970$s Nicolas proved that the coefficients $p_d(n)$ defined by the generating function \begin{equation*} \sum_{n=0}^{\infty} p_d(n) \, q^n = \prod_{n=1}^{\infty} \left( 1- q^n\right)^{-n^{d-1}} \end{equation*} are log-concave for…

Combinatorics · Mathematics 2022-06-23 Bernhard Heim , Markus Neuhauser