相关论文: Asymptotic equidistribution and convexity for part…

We study the Dyson rank function $N(r,3;n)$, the number of partitions of $n$ with rank $\equiv r \pmod 3$. We investigate the convexity of these functions. We extend $N(r,3;n)$ multiplicatively to the set of partitions, and we determine the…

Denote by $p(n)$ the number of partitions of $n$ and by $N(a,M;n)$ the number of partitions of $n$ with rank congruent to $a$ modulo $M$. We find and prove a general formula for Dyson's ranks by considering the deviation of the ranks from…

Let $j,n$ be even positive integers, and let $\overline{p}_j(n)$ denote the number of partitions with BG-rank $j$, and $\overline{p}_j(a,b;n)$ to be the number of partitions with BG-rank $j$ and $2$-quotient rank congruent to $a \pmod{b}$.…

In this paper we compute asymptotics for the coefficients of an infinite class of overpartition rank generating functions. Using these results, we show that $ \overline{N}(a,c,n), $ the number of overpartitions of $ n $ with rank congruent…

For integers $k,t \geq 2$ and $1\leq r \leq t$ let $D_k(r,t;n)$ be the number of parts among all $k$-regular partitions (i.e., partitions of $n$ where all parts have multiplicity less than $k$) of $n$ that are congruent to $r$ modulo $t$.…

The partition crank is a statistic on partitions introduced by Freeman Dyson to explain Ramanujan's congruences. In this paper, we prove that the crank is asymptotically equidistributed modulo Q, for any odd number Q. To prove this, we…

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…

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…

Let $k, t$ be coprime integers, and let $1 \leq r \leq t$. We let $D_k^\times(r,t;n)$ denote the total number of parts among all $k$-indivisible partitions (i.e., those partitions where no part is divisible by $k$) of $n$ which are…

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.

For $G=G_{n, 1/2}$, the Erd\H{o}s--Renyi random graph, let $X_n$ be the random variable representing the number of distinct partitions of $V(G)$ into sets $A_1, \ldots, A_q$ so that the degree of each vertex in $G[A_i]$ is divisible by $q$…

Dyson's rank function and the Andrews--Garvan crank function famously give combinatorial witnesses for Ramanujan's partition function congruences modulo 5, 7, and 11. While these functions can be used to show that the corresponding sets of…

Beck introduced two partition statistics $NT(r,m,n)$ and $M_{\omega}(r,m,n)$,which denote the total number of parts in the partition of $n$ with rank congruent to $r$ modulo $m$ and the total number of ones in the partition of $n$ with…

We utilize Dyson's concept of the adjoint of a partition to derive an infinite family of new polynomial analogues of Euler's Pentagonal Number Theorem. We streamline Dyson's bijection relating partitions with crank <= k and those with k in…

For integers $k,t \geq 2$, and $1\leq r \leq t$ let $D_k^\times(r,t;n)$ be the number of parts among all $k$-indivisible partitions of $n$ (i.e., partitions where all parts are not divisible by $k$) of $n$ that are congruent to $r$ modulo…

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

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 1944 Dyson defined the rank of a partition as the largest part minus the number of parts, and conjectured that the residue of the rank mod 5 divides the partitions of 5n+4 into five equal classes. This gave a combinatorial explanation of…

Bessenrodt and Ono initially found the strict log-subadditivity of partition function $p(n)$, that is, $p(a+b)< p(a)p(b)$ for $a,b>1$ and $a+b>9$. Many other important statistics of partitions are proved to enjoy similar properties. Lovejoy…

We prove a conjecture of Cuttler et al.~[2011] [A. Cuttler, C. Greene, and M. Skandera; \emph{Inequalities for symmetric means}. European J. Combinatorics, 32(2011), 745--761] on the monotonicity of \emph{normalized Schur functions} under…