Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Partitions into distinct parts with bounded largest part (2004.12036v2)

Published 25 Apr 2020 in math.NT, math.CO, and math.PR

Abstract: We prove an asymptotic formula for the number of partitions of $n$ into distinct parts where the largest part is at most $t\sqrt{n}$ for fixed $t \in \mathbb{R}$. Our method follows a probabilistic approach of Romik, who gave a simpler proof of Szekeres' asymptotic formula for distinct parts partitions when instead the number of parts is bounded by $t\sqrt{n}$. Although equivalent to a circle method/saddle-point method calculation, the probabilistic approach predicts the shape of the asymptotic formula, to some degree.

Summary

We haven't generated a summary for this paper yet.