2000 character limit reached
Uniform asymptotic formulas of restricted bipartite partitions
Published 17 Sep 2019 in math.NT | (1909.07762v2)
Abstract: In this paper, we investigate $\pi(m,n)$, the number of partitions of the \emph{bipartite number} $(m,n)$ into \emph{steadily decreasing} parts, introduced by L.Carlitz ['A problem in partitions', Duke Math Journal 30 (1963), 203--213]. We give a relation between $\pi(m,n)$ and the crank statistic $M(m,n)$ for integer partitions. Using this relation, some uniform asymptotic formulas for $\pi(m,n)$ are established.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.