Analytic combinatorics of non-crossing configurations

Discrete Mathematics

Volumn 204, Issue 1-3, 1999, Pages 203-229

  Flajolet, Philippe ^a   Noy, Marc ^b  

^a INRIA ROCQUENCOURT   (France)

^b UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037609113     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(98)00372-0     Document Type: Article

References (38)

1. S.-S. Abhyankar, Algebraic Geometry for Scientists and Engineers, American Mathematical Society, Providence, RI, 1990.
2. E.A. Bender, Central and local limit theorems applied to asymptotic enumeration, J. Combin. Theory 15 (1973) 91-111.
3. E.A. Bender, L.B. Richmond, Central and local limit theorems applied to asymptotic enumeration II: multivariate generating functions, J. Combin. Theory Ser. A 34 (1983) 255-265.
4. F. Bergeron, G. Labelle, P. Leroux, Théorie des espèces et combinatoire des structures arborescentes, in Publications du LACIM, No. 19, Université du Québec à Montréal, 1994.
5. F.R. Bernhart, Catalan, Motzkin, and Ring Numbers 204 (this Vol.) (1999) 73-112.
6. E.R. Canfield, Remarks on an asymptotic method in combinatorics, J. Combin. Theory Ser. A 37 (1984) 348-352.
7. L. Comtet, Advanced Combinatorics, Reidel, Dordrecht, 1974.
8. F.N. David, D.E. Barton, Combinatorial Chance, Charles Griffin, London, 1962.
9. L. Devroye, P. Flajolet, F. Hurtado, M. Noy, W. Steiger, Random triangulations (extended abstract), Discrete Comput. Geom. 1996, accepted.
10. C. Domb, A. Barrett, Enumeration of ladder graphs, Discrete Math. 9 (1974) 341-358.
11. M. Drmota, Systems of functional equations, Random Struct. Algorithms 10 (1-2) (1997) 103-124.
12. S. Dulucq, J.-G. Penaud, Cordes, arbres et permutations, Discrete Math. 117 (1993) 89-105.
13. W. Feller, An Introduction to Probability Theory and Its Applications, vol. 2, Wiley, New York, 1971.
14. P. Flajolet, H.-K. Hwang, M. Soria, The ubiquitous Gaussian law in analytic combinatorics, 1997, in preparation.
15. P. Flajolet, T. Lafforgue, Search costs in quadtrees and singularity perturbation asymptotics, Discrete Comput. Geom. 12 (4) (1994) 151-175.
16. P. Flajolet, A.M. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3 (2) (1990) 216-240.
17. P. Flajolet, R. Sedgewick, Analytic combinatorics, Book in preparation, 1998 (Individual chapters are available as INRIA Research Reports 1888, 2026, 2376, 2956, 3162).
18. D. Foata, La série génératrice exponentielle dans les problèmes d'énumération, S.M.S. Montreal University Press, 1974.
19. K.O. Geddes, S.R. Czapor, G. Labahn, Algorithms for Computer Algebra, Kluwer, Boston, 1992.
20. H.W. Gould, Research bibliography on two number sequences, Mathematica Monongaliae, 1971 (A comprehensive bibliography on Bell and Catalan numbers).
21. I.P. Goulden, D.M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
22. F. Harary, E.M. Palmer, Graphical Enumeration, Academic Press, New York, 1973.
23. E. Hille, Analytic Function Theory, vols. 1 and 2, Blaisdell, Waltham, 1962.
24. H.-K. Hwang, Théorèmes limites pour les structures combinatoires et les fonctions arithmetiques, Ph.D. Thesis, École Polytechnique, December 1994.
25. D.A. Klarner, P. Woodworth, Asymptotics for coefficients of algebraic functions, Aequationes Mathematicae 23 (1981) 236-241.
26. G. Kreweras, Sur les partitions non croisées d'un cycle, Discrete Math. 1 (1972) 333-350.
27. P. Lisonek, Closed forms for the number of polygon dissections, J. Symbolic Comput. 20 (1995) 595-601.
28. A. Meir, J.W. Moon, On the altitude of nodes in random trees, Can. J. Math. 30 (1978) 997-1015.
29. M. Noy, Enumeration of non-crossing trees on a circle, Discrete Math. 180 (1998) 301-313.
30. G. Pólya, R.C. Read, Combinatorial Enumeration of Groups, Graphs and Chemical Compounds, Springer, New York, 1987.
31. D.G. Rogers, The enumeration of a family of ladder graphs, Part II: Schroeder and superconnective relations, Quart. J. Math. Oxford (2) 31 (1980) 491-506.
32. B. Salvy, P. Zimmermann, GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable, ACM Trans. Math. Software 20 (2) (1994) 163-167.
33. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
34. N.J.A. Sloane, S. Plouffe, The Encyclopedia of Integer Sequences, Academic Press, New York, 1995.
35. R.P. Stanley, Generating functions, in: G.-C. Rota (Ed.), Studies in Combinatorics, M.A.A. Studies in Mathematics, vol. 17, The Mathematical Association of America, 1978, pp. 100-141.
36. R.P. Stanley, Hipparchus, Plutarch, Schröder and Hough, Amer. Math. Mon. 104 (1997) 344-350.
37. E.C. Titchmarsh, The Theory of Functions, 2nd ed., Oxford University Press, Oxford, 1939.
38. H.S. Wilf, Generatingfunctionology, Academic Press, New York, 1990.