A central limit theorem for integer partitions
Let \(\Lambda = (\Lambda_k)_{k\geq 1}\) be a non-decreasing sequence of positive integers. A \(\Lambda\)-partition of \(n\) is a representation of \(n\) of the form \(n = \sum_{j=1}^s \Lambda_{i_j} = n\) with \(i_1 < i_2 < \cdots < i_s\). The main result of this paper is a central limit theorem for the number of summands \(s\) of \(\Lambda\)-partitions of \(n\), provided that the Dirichlet series \(D(s) = \sum_{k\geq 1} \Lambda_k^{-s}\) satisfies certain analyticity properties. Usually it is assumed that \(D(s)\) has a simple pole at the abscissa of convergence \(\sigma_c\) and that \(D(s)(s-\sigma_c)\) can be continued analytically to \(\text{Re}(s) > \sigma_c - \eta\) (for some \(\eta> 0\)) -- this is the so-called Meinardus condition. In this case a central limit theorem was already known by \textit{H.-K. Hwang} [J. Comb. Theory, Ser. A 96, No. 1, 89--126 (2001; Zbl 1029.60013)]. The authors extend this property to situations where \(D(s)\) has infinitely poles \(s_m = \sigma_c + 2\pi i m \omega\), \(m\in \mathbb{Z}\), on the line \(\text{Re}(s) = \sigma_c\). This assumption is (usually) satisfied for certain \textit{automatic sequences} like missing digit sequences and gives rise to periodic terms in the asymptotic expansions. The proof is technical and quite involved. In particular it uses techniques from analytic number theory like the Mellin transform.
- Limit theorems for the number of summands in integer partitions
- scientific article; zbMATH DE number 856965
- On the number of summands in a random prime partition
- The asymptotic distribution of the number of summands in unrestricted Λ-partitions
- Asymptotische Formeln für Partitionen.
- Hankel and other extensions of Dirichlet's series.
- Distribution of integer partitions with large number of summands
- The Size of the Largest Part of Random Weighted Partitions of Large Integers
- Part sizes of random integer partitions
- A Note on the Theory of Moment Generating Functions
- A Tauberian theorem for partitions
- Asymptotische Aussagen über Partitionen
- Automatic Dirichlet series
- scientific article; zbMATH DE number 3577263 (Why is no real title available?)
- Limit theorems for the number of summands in integer partitions
- Mellin transforms and asymptotics: Digital sums
- Mellin transforms and asymptotics: Harmonic sums
- On arithmetic properties of integers with missing digits. I: Distribution in residue classes
- On arithmetic properties of integers with missing digits. II: Prime factors
- On the arithmetic structure of sets characterized by sum of digits properties
- Part sizes of random integer partitions
- Self-generating sets, integers with missing blocks, and substitutions
- SOME ASYMPTOTIC FORMULAE IN THE THEORY OF PARTITIONS
- The distribution of the number of summands in the partitions of a positive integer
- The number of distinct part sizes in a random integer partition
- The On-Line Encyclopedia of Integer Sequences
- Waring's problem with digital restrictions
- On the distribution of multiplicities in integer partitions
- General moment theorems for nondistinct unrestricted partitions
- On the number of summands in a random prime partition
- A Meinardus theorem with multiple singularities
- A Central Limit Theorem for Vincular Permutation Patterns
- scientific article; zbMATH DE number 7002430 (Why is no real title available?)
- Limit shapes via bijections
- Limit theorems for the number of summands in integer partitions
- A central limit theorem for integer partitions into small powers
- A central limit theorem for random ordered factorizations of integers
- A unified treatment of families of partition functions
This page was built for publication: A central limit theorem for integer partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961997)
