A. O. L. Atkin, F. G. Garvan
New identities and congruences involving the ranks and cranks of partitions are proved. The proof depends on a new partial differential equation connecting their generating functions.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
An Exploration of Crank Generating functions for $t$-core partitions
本文提出一族生成函数，解释$t$-核心分区的模数关系，拓展了crank生成函数的应用范围。
In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results and the different statistics with the crank of a partition. In particular, we prove that the number of partitions into even number of distinct parts whose odd-indexed parts' sum is n is equal to the number of partitions of n with non-negative crank.
In this paper, we discuss a few recent conjectures made by George Beck related to the ranks and cranks of partitions. The conjectures for the rank of a partition were proved by Andrews by using results due to Atkin and Swinnerton-Dyer on a suitable generating function, while the conjectures related to cranks were studied by Shane Chern using weighted partition moments. We revisit the conjectures on the crank of a partition by decomposing the relevant generating function and further explore connections with Apple-Lerch series and tenth order mock theta functions.
A partition statistic ` crank' gives combinatorial interpretations for Ramanujan's famous partition congruences. In this paper, we establish an asymptotic formula, Ramanujan type congruences, and q-series identities that the number of partitions with even crank $M_e(n)$ minus the number of partitions with odd crank $M_o(n)$ satisfies. For example, we show that $M_e(5n+4)-M_o(5n+4)\equiv 0 \pmod 5.$ We also determine the exact values of $M_e(n)-M_o(n)$ in case of partitions into distinct parts, which are at most two and zero for infinitely many $n$.
A proposed crank for $(k+j)$-colored partitions, with $j$ colors having distinct parts
本文推广了着色分拆的crank理论，借鉴已有研究的生成函数技术，定义了j色为互异分拆的(k+j)着色分拆的crank生成函数，给出三类无穷族并猜想通用形式，丰富了分拆同余相关研究。
The spt-function $spt(n)$ was introduced by Andrews as the weighted counting of partitions of $n$ with respect to the number of occurrences of the smallest part. Andrews, Garvan and Liang defined the spt-crank of an $S$-partition which leads to combinatorial interpretations of the congruences of $spt(n)$ mod 5 and 7. Let $N_S(m,n)$ denote the net number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Garvan and Liang showed that $N_S(m,n)$ is nonnegative for all integers $m$ and positive integers $n$, and they asked the question of finding a combinatorial interpretation of $N_S(m,n)$. In…
Andrews and Newman have recently introduced the notion of the mex of a partition, the smallest positive integer that is not a part. The concept has been used since at least 2011, though, with connections to Frobenius symbols. Recently the parity of the mex has been associated to the crank statistic named by Dyson in 1944. In this note, we extend and strengthen the connection between the crank and mex (along with a new generaliztion of the mex) by proving a number of properties that naturally relate these partition statistics.
Combinatorial Interpretations of Cranks of Overpartitions and Partitions without Repeated Odd Parts
本文为过划分的两个剩余曲柄及无重复奇数部分划分的 $M_2$-曲柄提供组合解释，给出无调整权重的新定义，并揭示其与秩统计量和 Ramanujan 十阶伪 theta 函数的联系。
Families of quasimodular forms arise naturally in many situations such as curve counting on Abelian surfaces and counting ramified covers of orbifolds. In many cases the family of quasimodular forms naturally arises as the coefficients of a Taylor expansion of a Jacobi form. In this note we give examples of such expansions that arise in the study of partition statistics. The crank partition statistic has gathered much interest recently. For instance, Atkin and Garvan showed that the generating functions for the moments of the crank statistic are quasimodular forms. The two variable generating …
This note is concerned with the set of integral solutions of the equation $x^2+3y^2=12n+4$, where $n$ is a positive integer. We will describe a parametrization of this set using the 3-core partitions of n. In particular we construct a crank using the action of a suitable subgroup of the isometric group of the plane that we connect with the unit group of the ring of Eisenstein integers. We also show that the process goes in the reverse direction: from the solutions of the equation and the crank, we can describe the 3-core partitions of n. As a consequence we describe an explicit bijection betwe…
Recent works of Andrews--Newman and Hopkins--Sellers unveil an interesting relation between two partition statistics, the crank and the mex. They state that, for a positive integer $n$, there are as many partitions of $n$ with non-negative crank as partitions of $n$ with odd mex. In this paper, we give a bijective proof of a generalization of this identity provided by Hopkins, Sellers, and Stanton. Our method uses an alternative definition of the Durfee decomposition, whose combinatorial link to the crank was recently studied by Hopkins, Sellers, and Yee.
Moments of the Crank Statistic for $t$-Core Partitions and Overpartitions
本文利用统一矩-迹框架，对$t$-核分拆和超分拆的曲柄统计量建立迹与逆迹公式，并借助完全Bell多项式导出分拆数的显式表达式。
The notion of the spt-crank of a vector partition, or an $S$-partition, was introduced by Andrews, Garvan and Liang. Let $N_S(m,n)$ denote the number of $S$-partitions of $n$ with spt-crank $m$. Andrews, Dyson and Rhoades conjectured that $\{N_S(m,n)\}_m$ is unimodal for any $n$, and they showed that this conjecture is equivalent to an inequality between the rank and the crank of ordinary partitions. They obtained an asymptotic formula for the difference between the rank and the crank of ordinary partitions, which implies $N_S(m,n)\geq N_S(m+1,n)$ for sufficiently large $n$ and fixed $m$. In t…
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 compositions. Somewhat unrelated, we give a combinatorial proof of a new truncated Euler pentagonal number theorem due to Xia and Zhao.
In 2003, Atkin and Garvan initiated the study of rank and crank moments for ordinary partitions. These moments satisfy a strict inequality. We prove that a strict inequality also holds for the first rank and crank moments of overpartitions and consider a new combinatorial interpretation in this setting.
Moments of the partition rank and crank statistics have been studied for their connections to combinatorial objects such as Durfee symbols, as well as for their connections to harmonic Maass forms. This paper proves a conjecture due to Bringmann and Mahlburg that refined a conjecture of Garvan. Garvan's conjecture states that the moments of the crank function are always larger than the moments of the rank function, even though the moments have the same main asymptotic term. The proof uses the Hardy-Ramanujan method to provide precise asymptotic estimates for rank and crank moments and their di…
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 $N_k(m,n)$ with $|m|\ge \sqrt{n}$ as $n\rightarrow \infty$. As a corollary, we give a more complete answer for the Dyson's crank distribution conjecture. We also establish some asymptotic formulas for finite differences of $N_k(m,n)$ with respect to $m$ with $m\gg \sqrt{n}\log n$.
Asymptotics for $k$-crank of $k$-colored partitions
本文利用Hardy-Ramanujan圆法研究k-着色分拆的k-crank，推广了Fu和Tang关于M_k(a,c;n)的不等式结果，并进一步建立了对数凹性与对数次可加性等新不等式关系。
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 M(\leq m,n)\leq N(\leq m+1,n)$ for $m<0$ and $1\leq n\leq 100$. They also pointed out that these inequalities can be restated as the existence of a re-ordering $τ_n$ on the set of partitions of $n$ such that $|\text{crank}(λ)|-|\text{rank}(τ_n(λ))|=0$ or $1$ for all partitions $λ$ of $n$, that is, the rank and the crank are nearly equal distributions over parti…
In this paper we show how Rank-Crank type PDE's (first found by Atkin and Garvan) occur naturally in the framework of non-holomorphic Jacobiforms and find an infinite family of such differential equations. As an application we show an infinite family of congruences for odd Durfee symbols, a partition statistic introduced by George Andrews.
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 partitions split into 5, 7, or 11 equally sized sets, one may ask how to make the resulting bijections between partitions organized by rank or crank combinatorially explicit. Stanton recently made conjectures which aim to uncover a deeper combinatorial structure along these lines, where it turns out that minor modifications of the rank and crank are required…
Biases among classes of rank-crank partitions$\pmod{11}$
本文证明了模11不同类间秩、曲率与分拆的不等式，证实了Borozenets的猜想。
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 obtain effective bounds on the error term from Zapata Rolon's asymptotic estimate for the crank function. We then use those bounds to prove the surjectivity and strict log-subadditivity of the crank function.
We study two types of crank moments and two types of rank moments for overpartitions. We show that the crank moments and their derivatives, along with certain linear combinations of the rank moments and their derivatives, can be written in terms of quasimodular forms. We then use this fact to prove exact relations involving the moments as well as congruence properties modulo 3, 5, and 7 for some combinatorial functions which may be expressed in terms of the second moments. Finally, we establish a congruence modulo 3 involving one such combinatorial function and the Hurwitz class number H(n).
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$. By considering the deviation \begin{equation*} D(a,M) := \sum_{n= 0}^{\infty}\left(N(a,M;n) - \frac{p(n)}{M}\right) q^n, \end{equation*} we give new proofs of recent results of Andrews, Berndt, Chan, Kim and Malik on mock theta functions and ranks of partitions. By considering deviations of cranks, we give new proofs of Lewis and Santa-Gadea's rank-crank identities. We revisit ranks and cranks modulus $M=5$ and $7$, with our results on cranks appearing to be…
Using quasimodular forms with respect to $Γ_0(4)$ we find exact relations between the M2-rank for partitions without repeated odd parts and three residual cranks. From these identities we are able to deduce various congruences mod 3 and 5 between the rank and crank moments. In turn, these congruences give congruences for $M2spt(n)$, the number of occurrences of smallest parts in the partitions of $n$ with smallest part even and without repeated odd parts, and for the higher order analog $M2spt_2(n)$.
In this paper, motivated by the work of Mahlburg, we find congruences for a large class of modular forms. Moreover, we generalize the generating function of the Andrews-Garvan-Dyson crank on partition and establish several new infinite families of congruences. In this framework, we showed that both the birank of an ordered pair of partitions introduced by Hammond and Lewis, and $k$-crank of $k$-colored partition introduced by Fu and Tang process the same as the partition function and crank.
Extending Andrews and Newman's refinement of the crank-mex theorem
本文基于 crank-mex 定理，研究偶数 mex 分拆与负 crank 和正 crank 分拆的关系，通过分析和组合方法证明了相关结果。
In this paper we obtain asymptotic formulas for the Fourier coefficients of an infinite family of crank generating functions. Moreover we use this result to show that the crank obeys certain inequalities. This implies that the crank can not explain any partition congruences in the usual way beside the three deduced by Ramanujan.
On the total number of ones associated with cranks of partitions modulo 11
本文研究了George Beck提出的分拆统计量$M_w(r,m,n)$，建立了$M_ω(r,11,n)-M_ω(11-r,11,n)$生成函数的11-分拆，并发现了涉及$M_ω(r,11,11n+6)$的优美恒等式。
By introducing $k$-marked Durfee symbols, Andrews found a combinatorial interpretation of $2k$-th symmetrized moment $η_{2k}(n)$ of ranks of partitions of $n$. Recently, Garvan introduced the $2k$-th symmetrized moment $μ_{2k}(n)$ of cranks of partitions of $n$ in the study of the higher-order spt-function $spt_k(n)$. In this paper, we give a combinatorial interpretation of $μ_{2k}(n)$. We introduce $k$-marked Dyson symbols based on a representation of ordinary partitions given by Dyson, and we show that $μ_{2k}(n)$ equals the number of $(k+1)$-marked Dyson symbols of $n$. We then introduce th…
We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous identity for $\textup{spt}(n)$. The latter motivates us to extend the theory of the restricted partition function $p(n, N)$, namely, the number of partitions of $n$ with largest parts less than or equal to $N$, by obtaining the finite analogues of rank and crank for vector partitions as well as of the rank and crank moments. As an application of the identity for o…
The inequality between rank and crank moments was conjectured and later proved by Garvan himself in 2011. Recently, Dixit and the authors introduced finite analogues of rank and crank moments for vector partitions while deriving a finite analogue of Andrews' famous identity for smallest parts function. In the same paper, they also conjectured an inequality between finite analogues of rank and crank moments, analogous to Garvan's conjecture. In the present paper, we give a proof of this conjecture.
In this paper we consider level l Appell functions, and find a partial differential equation for all odd l. For l=3 this recovers the Rank-Crank PDE, found by Atkin and Garvan, and for l=5 we get a similar PDE found by Garvan.
The main objective of this paper is to investigate the distribution of the Andrews-Garvan-Dyson crank of a partition. Let $M(m,n)$ denote the number of partitions of $n$ with the Andrews-Garvan-Dyson crank $m$, we show that the sequence \break $\{M(m,n)\}_{|m|\leq n-1}$ is unimodal for $n\geq 44$. It turns out that the unimodality of \break $\{M(m,n)\}_{|m|\leq n-1}$ is related to the monotonicity properties of two partition \break functions $p_k(n)$ and $pp_k(n)$. Let $p_k(n)$ denote the number of partitions of $n$ with at most $k$ parts such that the largest part appears at least twice and l…
Convexity and log-concavity of the partition function weighted by the parity of the crank
本文利用 crank 奇偶分拆函数差的渐近公式及其显式界，证明 $M_0(n)$ 与 $M_1(n)$ 的凸性，并进一步得到其对数凹性及高阶 Turán 不等式，细化了经典分拆函数 $p(n)$ 的凸性结果。
Cranks for Ramanujan-type congruences of $k$-colored partitions
本文为分拆函数同余族的不变量提供研究框架，利用θ块理论找到一族曲柄函数，可解释多数已知k着色分拆函数同余，具理论价值。
Bringmann, Lovejoy, and Osburn showed that the generating functions of the spt-overpartition functions spt(n), spt1(n), spt2(n), and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews, Garvan, and Liang defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences mod 5 and 7 for spt (n). Chen, Ji, and Zang were able to define this spt-crank in terms of ordinary partitions. In this paper we define spt-cranks in terms of vector partitions that combinatorially explain the known simple congruenc…
We generalize a result of Garvan on inequalities and interpretations of the moments of the partition rank and crank functions. In particular for nearly 30 Bailey pairs, we introduce a rank-like function, establish inequalities with the moments of the rank-like function and an associated crank-like function, and give an associated so called higher order smallest parts function. In some cases we are able to deduce inequalities among the rank-like functions. We also conjecture additional inequalities and a large number of congruences for the higher order smallest parts functions.
Crank equidistribution and $(k,j)$-overlined partitions
本文给出$(k,j)$-着色划线分拆数的渐近公式，证明Wagner构造的crank在算术级数上渐近等分布，推进了分拆理论中拉马努金型同余式相关研究。
Congruences modulo powers of $5$ and $7$ for the crank and rank parity functions and related mock theta functions
本文拓展了秩奇偶函数模5的幂的同余式至模7的幂的情形，推导了相关三阶仿theta函数ω(q)系数的同余式，并证明了曲柄奇偶函数的一族模7的幂的同余式。
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 the Rank-Set of partitions. Also, we extend Dyson's adjoint of a partition to MacMahon's ``modular'' partitions with modulus 2. This way we find a new combinatorial proof of Gauss's famous identity. We give a direct combinatorial proof that for n>1 the partitions of n with crank k are equinumerous with partitions of n with crank -k.
In a recent study of sign-balanced, labelled posets Stanley, introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' is the conjugate of pi. Andrews proved the following refinement of Ramanujan's partition congruence mod 5: p[0](5n +4) = p[2](5n + 4) = 0 (mod 5), p(n) = p[0](n) + p[2](n), where p[i](n) (i = 0; 2) denotes the number of partitions of n with srank = i (mod 4) and p(n) is the number of unrestricted partitions of n. Andrews asked for a partition statistic that would divide the partitions enume…
We show how Rank-Crank type PDEs for higher order Appell functions due to Zwegers may be obtained from a generalized Lambert series identity due to the first author. Special cases are the Rank-Crank PDE due to Atkin and the third author and a PDE for a level 5 Appell function also found by the third author. These two special PDEs are related to generalized Lambert series identities due to Watson, and Jackson respectively. The first author's Lambert series identities are common generalizations. We also show how Atkin and Swinnerton-Dyer's proof using elliptic functions can be extended to prove …
Andrews, Chan, and Kim recently introduced a modified definition of crank and rank moments for integer partitions that allows the study of both even and odd moments. In this paper, we prove the asymptotic behavior of these moments in all cases, and our main result states that while the two families of moment functions are asymptotically equal, the crank moments are always asymptotically larger than the rank moments. Andrews, Chan, and Kim primarily focused on one case, and proved the stronger result that the first crank moment is strictly larger than the first rank moment for all partitions by…
Atkin and Garvan introduced the functions $N_k(n)$ and $M_k(n)$, which denote the $k$-th moments of ranks and cranks in the theory of partitions. Let $e_{2r}(n)$ be the $n$-th Fourier coefficient of $E_{2r}(τ)/η(τ)$, where $E_{2r}(τ)$ is the classical Eisenstein series of weight $2r$ and $η(τ)$ is the Dedekind eta function. Via the theory of quasi-modular forms, we find that for $k \leq 5$, $N_k(n)$ and $M_k(n)$ can be expressed using $e_{2r}(n)$ ($2\leq r \leq k$), $p(n)$ and $N_2(n)$. For $k>5$, additional functions are required for such expressions. For $r\in \{2, 3, 4, 5, 7\}$, by studying…
Recently, Amdeberhan and Merca proved some arithmetic properties of the crank parity function $C(n)$ defined as the difference between the number of partitions of $n$ with even cranks and those with odd cranks and the sequence $a(n)$ whose generating function is the reciprocal of that of $C(n)$. The function $C(n)$ was first studied by Choi, Kang, and Lovejoy. In this note, we give new elementary proofs of some of their main results and extend them. In particular, we establish Ramanujan-type congruences modulo $5$ and $25$ for certain finite sums involving $C(n)$ and $a(n)$. Our proofs employ …
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, but for many other researchers' in India Ramanujan's work inspired for their career in mathematics. This is an undergraduate expository article.
Andrews' spt-function can be written as the difference between the second symmetrized crank and rank moment functions. Using the machinery of Bailey pairs a combinatorial interpretation is given for the difference between higher order symmetrized crank and rank moment functions. This implies an inequality between crank and rank moments that was only know previously for sufficiently large n and fixed order. This combinatorial interpretation is in terms of a weighted sum of partitions. A number of congruences for higher order spt-functions are derived.
We consider the symmetrized moments of three ranks and cranks, similar to the work of Garvan for the rank and crank of a partition. By using Bailey pairs and elementary rearrangements, we are able to find useful expressions for these moments. We then deduce inequalities between the corresponding ordinary moments. In particular we prove that the crank moment for overpartitions is always larger than the rank moment for overpartitions; with recent asymptotics this was known to hold for sufficiently large values of n for each fixed k. Lastly we provide higher order spt functions for overpartitions…
Let $N_k(m,n)$ denote the number of partitions of $n$ with Garvan $k$-rank $m$. It is well-known that Andrews-Garvan-Dyson's crank and Dyson's rank are the $k$-rank for $k=1$ and $k=2$, respectively. In this paper, we prove that the sequence $\{N_k(m,n)\}_{|m|\le n-k-71}$ is log-concave for all sufficiently large $n$ and each integer $k$. In particular, we partially solve the log-concavity conjecture for Andrews-Garvan-Dyson's crank and Dyson's rank, which was independently proposed by Bringmann-Jennings-Shaffer-Mahlburg and Ji-Zang.
Congruences Modulo Powers of 7 for the Reciprocal Crank Parity Function
本文研究了 reciprocal crank 奇偶函数在 7 的幂次模下的新 congruences，扩展了之前关于 crank 奇偶函数算术性质的研究。
Using an extension of Wright's version of the circle method, we obtain asymptotic formulae for partition ranks similar to formulae for partition cranks which where conjectured by F. Dyson and recently proved by the first author and K. Bringmann.
Deviation of the rank and crank modulo 11
本文基于 Garvan、Sarma 和 Berndt 的结果，建立了 rank 与 crank 偏差模 11 的 11-dissection，重新推导了已有结果，并利用 theta 函数商的正性条件证明了新的 rank-crank 不等式及多种同余。
In this paper we obtain asymptotic formulas for the positive crank and rank moments for overpartitions. Moreover, we show that crank and rank moments are asymptotically equal while the difference is asymptotically positive. This indicates that there exist analogous higher ospt-functions for overpartitions, which we define.
Recently, much attention has been given to various inequalities among partition functions. For example, Nicolas, {and later DeSavlvo--Pak,} proved that $p(n)$ is eventually log-concave, and Ji--Zang showed that the cranks are eventually unimodal. This has led to a flurry of recent activity generalizing such results in different directions. At the same time, Stanton recently made deep conjectures on the positivity of certain polynomials associated to ranks and cranks of partitions, with the ultimate goal of pointing the way to ``deeper'' structure refining ranks and cranks. These have been show…
Recently, Andrews, Chan, Kim and Osburn introduced a $q$-series $h(q)$ for the study of the first positive rank and crank moments for overpartitions. They conjectured that for all integers $m \geq 3$, \begin{equation*}\label{hqcon} \frac{1}{(q)_{\infty}} (h(q) - m h(q^{m})) \end{equation*} has positive power series coefficients for all powers of $q$. Byungchan Kim, Eunmi Kim and Jeehyeon Seo provided a combinatorial interpretation and proved it is asymptotically true by circle method. In this note, we show this conjecture is true if $m$ is any positive power of $2$, and we show that in order t…
By considering the $M_2$-rank of an overpartition as well as a residual crank, we give another combinatorial refinement of the congruences $\overline{\mbox{spt}}_2(3n)\equiv \overline{\mbox{spt}}_2(3n+1)\equiv 0\pmod{3}$. Here $\overline{\mbox{spt}}_2(n)$ is the total number of occurrences of the smallest parts among the overpartitions of $n$ where the smallest part is even and not overlined. Our proof depends on Bailey's Lemma and the rank difference formulas of Lovejoy and Osburn for the $M_2$-rank of an overpartition. This congruence, along with a modulo $5$ congruence, has previously been …
Equidistribution and partition polynomials
本文利用等分布准则证明了多种分拆多项式被分圆多项式整除，并建立了其根在单位圆上的等分布，为多种 Ramanujan 型同余提供了新证明。
In a recent study of sign-balanced, labelled posets Stanley [13], introduced a new integral partition statistic srank(pi) = O(pi) - O(pi'), where O(pi) denotes the number of odd parts of the partition pi and pi' the conjugate of pi. In [1] Andrews proved the following refinement of Ramanujan's partition congruence mod 5: p[0](5n +4) = p[2](5n + 4) = 0 (mod 5), p(n) = p[0](n) + p[2](n), where p[i](n) (i = 0, 2) denotes the number of partitions of n with srank = i (mod 4) and p(n) is the number of unrestricted partitions of n. Andrews asked for a partition statistic that would divide the partiti…
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。