Expected Number of Distinct Part Sizes in a Random Integer Composition

Combinatorics Probability and Computing

Volumn 9, Issue 6, 2000, Pages 519-527

  Hitczenko, P ^a   Stengle, G ^b  

^a DREXEL UNIVERSITY   (United States)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034551055     PISSN: 09635483     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0963548300004399     Document Type: Article

References (11)

1. Andrews, G. E. (1976) The Theory of Partitions, Addison-Wesley, Reading, MA.
2. Boyd, D. W. (1972) Losing runs in Bernoulli trials. Unpublished manuscript.
3. Corteel, S., Pittel, B., Savage, C. D. and Wilf, H. S. (1999) On the multiplicity of parts in a random partition. Random Structures and Algorithms 14 185-197.
4. Eisenberg, B., Stengle, G. and Strang, G. (1993) The asymptotic probability of a tie for first place. Ann. Appl. Probab. 13 731-745.
5. Erdos, P. and Lehner, J. (1941) The distribution of the number of summands in the partitions of positive integer. Duke Math. J. 8 335-345.
6. Flajolet, P. and Sedgewick, R. (1995) Mellin transform and asymptotics: finite differences and Rice's integrals. Theoret. Comput. Sci. 144 (special volume on mathematical analysis of algorithms) 101-124.
7. Goh, W. M. Y. and Schmutz, E. (1995) The number of different part sizes in a random integer partition. J. Combin. Theory Ser. A 69 149-158.
8. Guibas, L. J. and Odlyzko, A. M. (1980) Long repetitive patterns in random sequences. Z. Wahrscheinlichkeitstheorie und Verv. Gebiete 53 241-262.
9. Hitczenko, P. and Savage, C. D. (1999) On the multiplicity of parts in a random composition of a large integer. Preprint.
10. Kirschenhofer, P. and Prodinger, H. (1996) The number of winners in a discrete geometrically distributed sample. Ann. Appl. Probab. 6 687-694.
11. Wilf, H. S. (1983) Three problems in combinatorial asymptotics. J. Combin. Theory Ser. A 35 199-207.