Indexed metadata

Uniform Asymptotics for Andrews-Beck Partition Statistics

Renrong Mao

Source record

Source: arXiv

Published: Oct 12, 2026

arXiv: 2610.16024

Open original source ↗

Source abstract

Let $\NT(m,n)$ be the total number of parts in the partitions of nn with rank mm, and let $\MW(m,n)$ be the total number of ones in the partitions of nn with crank mm. Using the uniform generalized-rank estimate of Liu and Zhou, we establish asymptotic formulas for NT(m,n)NT(m,n) and $\MW(m,n)$. Put βn=π/6nβ_n=π/\sqrt{6n} and Ln=log⁡(1/βn)L_n=\log(1/β_n). For every fixed A>0A>0, uniformly for ∣m∣≤An|m|\le A\sqrt n, we prove \begin{align*} \NT(m,n)&=\frac{p(n)L_n}{4}\sech^2\!\left(\frac{β_nm}{2}\right) +O_A\!\bigl(p(n)\log L_n\bigr) \intertext{ and} \MW(m,n)&=\frac{p(n)}4\log(1+e^{-β_nm}) \sech^2\!\left(\frac{β_nm}{2}\right) +O_A\!\bigl(p(n)\sqrt{β_nL_n}\bigr). \end{align*}

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.

Uniform Asymptotics for Andrews-Beck Partition Statistics — Mathematical Frontier Network