Distinctness of compositions of an integer: A probabilistic analysis

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 407-437

  Hitczenko, Paweł ^a   Louchard, Guy ^b  

^a DREXEL UNIVERSITY   (United States)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035539871     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10008     Document Type: Article

References (40)

1. D. Aldous, Probability approximations via the Poisson clumping heuristics, Springer-Verlag, Heidelberg, 1989.
2. D. Aldous and M. Brown, Inequalities for rare events in time-reversible Markov chains I, Stochastic Inequalities, IMS 22 (1992), 1-16.
3. D. Aldous and M. Brown, Inequalities for rare events in time-reversible Markov chains II, Stochastic Process Appl 44 (1993), 15-25.
4. G.E. Andrews, The theory of partitions, Addison-Wesley, Reading, MA, 1976.
5. E.A. Bender, Central and local limit theorems applied to asymptotic enumeration, J Combin Theor Ser A 15 (1973), 91-111.
6. S.L. Campbell and C.D. Meyer, Generalized inverse of linear transformations, Pitman, London, 1979.
7. L. Carlitz, Restricted compositions, The Fibonacci Quart 14, (1976), 254-264.
8. V.P. Chistyakov, Discrete limit distributions in the problem of balls falling in cells with arbitrary probabilities, Math Notes 1 (1967), 6-11.
9. P. Erdös and J. Lehner, The distribution of the number of summands in the partitions of positive integer, Duke Math J 8 (1941), 335-345.
10. J.A. Fill, H. Mahmoud, W. Szpankowski, On the distribution of the duration of a randomized leader election algorithm, Ann Appl Probab 1 (1996), 1260-1283.
11. P. Flajolet, Approximate counting: A detailed analysis, BIT 25 (1985), 113-134.
12. P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM J Alg Discrete Meth 3 (1990), 216-240.
13. P. Flajolet and M. Soria, General combinatorial schemes: Gaussian limit distribution and exponential tails, Discrete Math 114 (1993), 159-180.
14. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transform and asymptotics: Harmonic sums, Theor Comput Sci 144 (1995), 3-58.
15. P. Flajolet and G. Martin, Probabilistic counting algorithms for data base applications, J Comput System Sci 31 (1985), 182-209.
16. P. Flajolet and R. Sedgewick, The average case analysis of algorithms: Saddle point asymptotics, INRIA T.R. 2376 (1994).
17. W.M.Y. Goh and P. Hitczenko, On the number of distinct part sizes in a random Carlitz composition, Eur J Combin to appear (http://www.mcs.drexel.edu/~phitczen).
18. W.M.Y. Goh and E. Schmutz, The number of different part sizes in a random integer partition, J Combin Theory Ser A 69 (1995), 149-158.
19. P. Hitczenko and C.D. Savage, On the multiplicity of parts in a random composition of a large integer, preprint, 1999 (http://www.mcs.drexel.edu/~phitczen).
20. P. Hitczenko and G. Stengle, Expected number of distinct part sizes in a random integer composition, Combin Probab Comput 9 (2000), 519-527, (also available at http://www.mcs.drexel.edu/~phitczen).
21. H.K. Hwang and Y.N. Yeh, Measures of distinctness for random partitions and compositions of an integer, Adv Appl Math 19 (1997), 378-414.
22. H.K. Hwang, On convergence rates in the central limit theorems for combinatorial structures, Eur J Combin 19 (1998), 329-343.
23. S. Jacquet and W. Szpankowski, Analytical de-Poissonization and its applications, Theor Comput Sci 201 (1998), 1-62.
24. S. Janson and W. Szpankowski, Analysis of the asymmetric leader election algorithm, Electron J Combin 4(1) (1997), research paper 17, 16 pp.
25. T. Kato, Perturbation theory for linear operators, Springer-Verlag, Heidelberg, 1966.
26. J. Keilson, Markov chain models - Rarity and exponentiality, Springer-Verlag, Heidelberg, 1979.
27. J.G. Kemeny, J.L. Snell, and A.W. Knapp, Denumerable Markov chains, Van Nostrand, Princeton, NJ, 1966.
28. C. Kenyon, G. Louchard, and R. Schott, Data structures maxima, SIAM J Comput 26 (1997), 1006-1042.
29. A. Knopfmacher and H. Mays, Compositions with m distinct parts, Ars Combin 53 (1999), 111-128.
30. A. Knopfmacher and H. Prodinger, On Carlitz compositions, Eur J Combin 19 (1998), 579-589 (http://www.idealibrary.com).
31. D.E. Knuth, The art of computer programming, V.3, Addison-Wesley, Reading, MA, 1998.
32. G. Louchard, Recurrence times and capacities for finite ergodic chains, Duke Math J 33 (1966), 13-22.
33. G. Louchard, Brownian motion and algorithm complexity, BIT 26 (1986), 17-34.
34. G. Louchard, Exact and asymptotic distributions in digital and binary search trees, RAIRO Inform Théor Appl 21 (1987), 479-495.
35. G. Louchard, Probabilistic analysis of adaptive sampling, Random Struct Alg 10 (1997), 157-168.
36. G. Louchard, Probabilistic analysis of column-convex and directed diagonally-convex animals H. Random Struct Alg 15 (1999), 1-23.
37. G. Louchard and H. Prodinger, Probabilistic analysis of Carlitz compositions, preprint (http://www.wits.ac.za/helmut/paperlst.htm).
38. G. Louchard and W. Szpankowski, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Trans Inform Theory 41 (1995), 478-488.
39. B.A. Sevastyanov and V.P. Chistyakov, Asymptotic normality in the classical problem of balls, Theor Prohab Appl 9 (1964), 198-211.
40. H.S. Wilf, Three problems in combinatorial asymptotics, J Combin Theory Ser A 35 (1983), 199-207.