Longest run of equal parts in a random integer composition
From MaRDI portal
(Redirected from Publication:472973)
Abstract: This note examines a problem in enumerative and asymptotic combinatorics involving the classical structure of integer compositions. What is sought is an analysis on average and in distribution of the length of the longest run of consecutive equal parts in a composition of size n. The problem was recently posed by Herbert Wilf (see arXiv: 0906.5196).
Recommendations
- A generating functionology approach to a problem of Wilf
- Distinctness of compositions of an integer: A probabilistic analysis
- On the Multiplicity of Parts in a Random Composition of a Large Integer
- On the distribution of the longest run in number partitions
- The number of part sizes of a given multiplicity in a random Carlitz composition
Cites work
- scientific article; zbMATH DE number 1753163 (Why is no real title available?)
- Analytic combinatorics
- Ascents of size less than \(d\) in compositions
- Asymptotics of the moments of extreme-value related distribution functions
- Combinatorics of geometrically distributed random variables: Run statistics
- Distinctness of compositions of an integer: A probabilistic analysis
- Mellin transforms and asymptotics: Harmonic sums
- On Carlitz compositions
- Runs of geometrically distributed random variables: A probabilistic analysis
- The distribution of ascents of size \(d\) or more in compositions
- The distribution of run lengths in integer compositions
- The number of distinct values in a geometrically distributed sample
Cited in
(3)
This page was built for publication: Longest run of equal parts in a random integer composition
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472973)