A Local Limit Theorem for Integer Partitions into Small Powers

2023/11/15 by Lipnik, Gabriel F., Madritsch, Manfred G., Tichy, Robert F. · 1 citation
#05A17 #11P82 #60F05 #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2311.09203

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.

Cited by

• Proof of a conjecture by Starr and log-concavity for random commuting permutations

Related

• On the Largest Part Size and Its Multiplicity of a Random Integer\n Partition
• Sampling Parts of Random Integer Partitions: A Probabilistic and Asymptotic Analysis
• A robust quantitative local central limit theorem with applications to enumerative combinatorics and random combinatorial structures
• Partitions with fixed largest hook length
• Asymptotic Properties of Random Restricted Partitions