A generalized Hardy-Ramanujan formula for the number of restricted integer partitions

From MaRDI portal
Publication:2631701

DOI10.1016/J.JNT.2019.02.006zbMATH Open1456.11200arXiv1805.06108OpenAlexW2964142688MaRDI QIDQ2631701FDOQ2631701


Authors: Yanyan Li Edit this on Wikidata


Publication date: 16 May 2019

Published in: Journal of Number Theory (Search for Journal in Brave)

Abstract: We derive the asymptotic formula for pn(N,M), the number of partitions of integer n with part size at most N and length at most M. We consider both N and M are comparable to sqrtn. This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.


Full work available at URL: https://arxiv.org/abs/1805.06108




Recommendations




Cites Work


Cited In (10)





This page was built for publication: A generalized Hardy-Ramanujan formula for the number of restricted integer partitions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2631701)