Related papers: Dyson's Rank, overpartitions, and weak Maass forms

Understanding the relationship between mock modular forms and quantum modular forms is a problem of current interest. Both mock and quantum modular forms exhibit modular-like transformation properties under suitable subgroups of…

We propose an original approach to the problem of rankunimodality for Dyck lattices. It is based on a well known recursive construction of Dyck paths originally developed in the context of the ECO methodology, which provides a partition of…

Mahlburg (2005) brilliantly showed the importance of crank functions in partition congruences that were originally guessed by Dyson (1944). Ramanujan's partition functions are the centre of these works. Not only for the theory on cranks,…

We present examples of Maass forms on Hecke congruence groups, giving low eigenvalues on $\Gamma_0(p)$ for small prime $p$, and the first 1000 eigenvalues for $\Gamma_0(11)$. We also present calculations of the $L$-functions associated to…

In this paper, we obtain asymptotic formulas for an infinite class of rank generating functions. As an application, we solve a conjecture of Andrews and Lewis on inequalities between certain ranks.

Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for…

We prove that the generating function of overpartition $M2$-rank differences is, up to coefficient signs, a component of the vector-valued mock Eisenstein series attached to a certain quadratic form. We use this to compute analogs of the…

This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…

Sander Zwegers showed that Ramanujan's mock theta functions are $q$-hypergeometric series, whose $q$-expansion coefficients are half of the Fourier coefficients of a non-holomorphic modular form. George Andrews, Henri Cohen, Freeman Dyson,…

We introduce a method for proving almost sure termination in the context of lambda calculus with continuous random sampling and explicit recursion, based on ranking supermartingales. This result is extended in three ways. Antitone ranking…

In this paper, we build on recent results of Frank Garvan and Rishabh Sarma as well as classical results of Bruce Berndt in order to establish the 11-dissection of the deviations of the rank and crank modulo 11. Using our new dissections we…

The crank is a partition statistic requested by Dyson in 1944 in order to combinatorially prove a Ramanujan congruence of Euler's partition function $p(n)$. In this paper, we provide connections between Dyson's crank and unimodal…

We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…

This is the second of two coupled papers estimating the mean values of multiplicative functions, of unknown support, on arithmetic progressions with large differences. Applications are made to the study of primes in arithmetic progression…

We use tools of additive combinatorics for the study of subvarieties defined by {\it high rank} families of polynomials in high dimensional $\mathbb{F} _q$-vector spaces. In the first, analytic part of the paper we prove a number properties…

We survey divisibility properties of the Fourier coefficients of modular functions inspired by Ramanujan. Then using recent results of the generalized Hecke operator on harmonic Maass functions and known divisibility of Fourier coefficients…

Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq…

In 2021, Andrews mentioned that George Beck introduced a partition statistic $NT(r,m,n)$ which is related to Dyson's rank statistic. Motivated by Andrews's work, scholars have established a number of congruences and identities involving…

We obtain identities and relationships between the modular $j$-function, the generating functions for the classical partition function and the Andrews $spt$-function, and two functions related to unimodal sequences and a new partition…

We consider the problem of exact low-rank matrix completion from a geometric viewpoint: given a partially filled matrix M, we keep the positions of specified and unspecified entries fixed, and study how the minimal completion rank depends…