2000 character limit reached
Partitions into Beatty sequences
Published 24 Aug 2020 in math.NT and math.CO | (2008.10500v2)
Abstract: Let $\alpha>1$ be an irrational number. We establish asymptotic formulas for the number of partitions of $n$ into summands and distinct summands, chosen from the Beatty sequence $(\lfloor\alpha m\rfloor)_{m\in\mathbb{N}}$. This improves some results of Erd\"{o}s and Richmond established in 1977.
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.
