Average number of distinct part sizes in a random Carlitz composition

Authors:
William M. Y. Goh;Pawel Hitczenko
Affiliations:
Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA;Department of Mathematics and Computer Science, Drexel University, Philadelphia, PA
Venue:
European Journal of Combinatorics
Year:
2002

Citing 4
Cited 0

Mellin transforms and asymptotics: harmonic sums

Theoretical Computer Science - Special volume on mathematical analysis of algorithms (dedicated to D. E. Knuth)
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
On Carlitz compositions

European Journal of Combinatorics
Expected Number of Distinct Part Sizes in a Random Integer Composition

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A composition of an integer n is called Carlitz if adjacent parts are different. Several characteristics of random Carlitz compositions have been studied recently by Knopfmacher and Prodinger. We will complement their work by establishing asymptotics of the average number of distinct part sizes in a random Carlitz composition.