A Local Limit Theorem for Integer Partitions into Small Powers
Abstract
The investigation of partitions of integers plays an important role in combinatorics and number theory. Among the many variations, partitions into powers 0<α<1 were of recent interest. In the present paper we want to extend our considerations of the length of a random partition by providing a local limit theorem.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.