arXiv:1805.06108·math.CO·March 14, 2019·1 cites
A generalized Hardy-Ramanujan formula for the number of restricted integer partitions
Tiefeng Jiang, Ke Wang

TL;DR
None
Contribution
None
Abstract
We derive the asymptotic formula for , the number of partitions of integer with part size at most and length at most . We consider both and are comparable to . This is an extension of the classical Hardy-Ramanujan formula and Szekeres' formula. The proof relies on the saddle point method.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Advanced Mathematical Identities · Advanced Combinatorial Mathematics
