The number of distinct part sizes in a random integer partition
From MaRDI portal
This paper presents a central limit theorem for the number of different part sizes in a random partition of an integer \(n\) into a multiset of positive integers.
Cites work
- A Note on the Theory of Moment Generating Functions
- ASYMPTOTIC PARTITION FORMULAE
- On some problems of the statistical theory of partitions with application to characters of the symmetric group. III
- The distribution of the number of summands in the partitions of a positive integer
- The moments of partitions, I
- The Structure of Random Partitions of Large Integers
- Three problems in combinatorial asymptotics
Cited in
(27)- Character tables of \(p\)-groups with derived subgroup of prime order. III.
- On the distribution of the longest run in number partitions
- On the random Young diagrams and their cores
- On a likely shape of the random Ferrers diagram
- Limiting distributions for the number of distinct component sizes in relational structures
- Measures of distinctness for random partitions and compositions of an integer
- On a phenomenon of Turán concerning the summands of partitions
- The distribution of the number of parts of \(m\)-ary partitions modulo \(m\)
- On the distribution of multiplicities in integer partitions
- Distinct \(r\)-tuples in integer partitions
- Asymptotic expression for raw moment of the multiplicity of a part in a general partition function
- On the maximal multiplicity of parts in a random integer partition
- On zero-sum free sequences contained in random subsets of finite cyclic groups
- Distinctness of compositions of an integer: A probabilistic analysis
- The number of smallest parts in the partitions of n
- On the number of summands in a random prime partition
- The corners of core partitions
- On the monoid generated by a Lucas sequence
- The number of parts in the (distinct) partitions with parts from a set
- Limit theorems for the number of summands in integer partitions
- Random partitions with non-negative \(r\)th differences
- A central limit theorem for integer partitions
- A central limit theorem for integer partitions into small powers
- Covering \(\mathsf{Irrep}(S_n)\) with tensor products and powers
- A general asymptotic scheme for the analysis of partition statistics
- Distribution of alternating sums of parts in partitions
- Subdiagonal and superdiagonal partitions
This page was built for publication: The number of distinct part sizes in a random integer partition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1344234)