Twenty combinatorial examples of asymptotics derived from multivariate generating functions

SIAM Review

Volumn 50, Issue 2, 2008, Pages 199-272

  Pemantle, Robin ^a   Wilson, Mark C ^b  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Enumeration; Kernel method; Lagrange inversion; Multiple point; Residue; Singularity; Smooth point; Stratified Morse theory; Transfer matrix

Indexed keywords

ASYMPTOTIC ANALYSIS; GRAPH THEORY; MULTIVARIANT ANALYSIS; TRANSFER MATRIX METHOD;

MULTIVARIATE GENERATING FUNCTION; POLYOMINOES; STRATIFIED MORSE THEORY;

COMBINATORIAL MATHEMATICS;

EID: 44949173898     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/050643866     Document Type: Article

References (72)

1. I. A. AǏZENBERG AND A. P. YUZHAKOV, Integral Representations and Residues in Multidimensional Complex Analysis, Transl, Math. Monogr. 58, AMS, Providence, RI, 1983.
2. G. E. ANDREWS AND K. ERIKSSON, Integer Partitions, Cambridge University Press, Cambridge, UK, 2004.
3. C. BANDERIER, P. FLAJOLET, G. SCHAEFFER, AND M. SORIA, Random maps, coalescing saddles, singularity analysis, and Airy phenomena, Random Structures Algorithms, 19 (2001), pp. 194-246.
4. Y. BARYSHNIKOV AND R. PEMANTLE, Generating functioning with poles on a hyperplane arrangement, in preparation.
5. E. A. BENDER, Central and local limit theorems applied to asymptotic enumeration, J. Combin. Theory Ser. A, 15 (1973), pp. 91-111.
6. E. A. BENDER, Asymptotic methods in enumeration, SIAM Rev., 16 (1974), pp. 485-515.
7. E. A. BENDER AND L. B. RICHMOND, Central and local limit theorems applied to asymptotic enumeration. II. Multivariate generating functions, J. Combin. Theory Ser. A, 34 (1983), pp. 255-265.
8. E. A. BENDER AND L. B. RICHMOND, Multivariate asymptotics for products of large powers with applications to Lagrange inversion, Electron. J. Combin., 6 (1999), article 8 (electronic).
9. E. A. BENDER, L. B. RICHMOND, AND S. G. WILLIAMSON, Central and local limit theorems applied to asymptotic enumeration. III. Matrix recursions, J. Combin. Theory Ser. A, 35 (1983), pp. 263-278.
10. A. BERTOZZI AND J. MCKENNA, Multidimensional residues, generating functions, and their application to queueing networks, SIAM Rev., 35 (1993), pp. 239-268.
11. M. BOUSQUET-MÉLOU AND M. PETKOVŠEK, Linear recurrences with constant coefficients: The multivariate case, Discrete Math., 225 (2000), pp. 51-75.
12. F. CHUNG, R. GRAHAM, J. MORRISON, AND A. ODLYZKO, Pebbling a chessboard, Amer. Math. Monthly, 102 (1995), pp. 113-123.
13. H. COHN, N. ELKIES, AND J. PROPP, Local statistics for random domino tilings of the Aztec diamond, Duke Math. J., 85 (1996), pp. 117-166.
14. L. COMTET, Advanced Combinatorics, D. Reidel Publishing, Dordrecht, The Netherlands, 1974.
15. D. A. Cox, J. LITTLE, AND D. O'SHEA, Using Algebraic Geometry, 2nd ed., Grad. Texts Math. 185, Springer-Verlag, New York, 2005.
16. J. A. DE LOERA AND B. STURMFELS, Algebraic unimodular counting, Math. Program., 96 (2003), pp. 183-203.
17. E. DEUTSCH AND L. SHAPIRO, A survey of the Fine numbers, Discrete Math., 241 (2001), pp. 241-265.
18. M. DRMOTA, A bivariate asymptotic expansion of coefficients of powers of generating functions, European J. Combin., 15 (1994), pp. 139-152.
19. R. DURRETT, Probability: Theory and Examples, 3rd ed., Duxbury Press, Belmont, CA, 2004.
20. P. FLAJOLET AND A. ODLYZKO, Singularity analysis of generating functions, SIAM J. Discrete Math., 3 (1990), pp. 216-240.
21. P. FLAJOLET AND R. SEDGEWICK, Analytic combinatorics, in preparation. Version 0.7 (2006) downloaded from http://algo.inria.fr/ flajolet/Publications/books.html.
22. A. FLAXMAN, A. W. HARROW, AND G. B. SORKIN, Strings with maximally many distinct subsequences and substrings, Electron. J. Combin., 11 (2004), article 8 (electronic).
23. H. FURSTENBERG, Algebraic functions over finite fields, J. Algebra, 7 (1967), pp. 271-277.
24. Z. GAO AND L. B. RICHMOND, Central and local limit theorems applied to asymptotic enumeration. IV. Multivariate generating functions, J. Comput. Appl. Math., 41 (1992), pp. 177-186.
25. Z. GAO AND N. C. WORMALD, The size of the largest components in random planar maps, SIAM J. Discrete Math., 12 (1999), pp. 217-228.
26. Z. GAO AND N. C. WORMALD, The distribution of the maximum vertex degree in random planar maps, J. Combin. Theory Ser. A, 89 (2000), pp. 201-230.
27. D. GARDY, Some results on the asymptotic behaviour of coefficients of large powers of functions, Discrete Math., 139 (1995), pp. 189-217.
28. I. M. GEL'FAND, M. M. KAPRANOV, AND A. V. ZELEVINSKY, Discriminants, Resultants, and Multidimensional Determinants, Math. Theory Appl., Birkhäuser Boston, Boston, MA, 1994.
29. I. M. GESSEL, Super ballot numbers, J. Symbolic Comput., 14 (1992), pp. 179-194.
30. J. GILLIS, B. REZNICK, AND D. ZEILBERGER, On elementary methods in positivity theory, SIAM J. Math. Anal., 14 (1983), pp. 396-398.
31. M. GORESKY AND R. MACPHERSON, Stratified Morse Theory, Ergeb. Math. Grenzgeb. (3) 14, Springer-Verlag, Berlin, 1988.
32. I. P. GOULDEN AND D. M. JACKSON, Combinatorial Enumeration, Dover, Mineola, NY, 2004.
33. J. R. GRIGGS, P. HANLON, A. M. ODLYZKO, AND M. S. WATERMAN, On the number of alignments of k sequences, Graphs Combin., 6 (1990), pp. 133-146.
34. J. R. GRIGGS, P. J. HANLON, AND M. S. WATERMAN, Sequence alignments with matched sections, SIAM J. Algebraic Discrete Methods, 7 (1986), pp. 604-608.
35. L. J. GUIBAS AND A. M. ODLYZKO, String overlaps, pattern matching, and nontransitive games, J. Combin. Theory Ser. A, 30 (1981), pp. 183-208.
36. G. HARDY AND S. RAMANUJAN, Asymptotic formulae for the distribution of integers of various types, Proc. London Math. Soc., 16 (1917), pp. 112-132.
37. M. L. J. HAUTUS AND D. A. KLARNER, The diagonal of a double power series, Duke Math. J., 38 (1971), pp. 229-235.
38. W. K. HAYMAN, A generalisation of Stirling's formula, J. Reine Angew. Math., 196 (1956), pp. 67-95.
39. P. HENRICI, Applied and Computational Complex Analysis. Vol. 2, Wiley Classics Library, John Wiley, New York, 1991.
40. L. HÖRMANDER, An Introduction to Complex Analysis in Several Variables, 3rd ed., North-Holland Math. Library 7, North-Holland, Amsterdam, The Netherlands, 1990.
41. H.-K. HWANG, Large deviations for combinatorial distributions. I. Central limit theorems, Ann. Appl. Probab., 6 (1996), pp. 297-319.
42. H.-K. HWANG, Large deviations of combinatorial distributions. II. Local limit theorems, Ann. Appl. Probab., 8 (1998), pp. 163-181.
43. Y. KOCAN, Asymptotic expansions for large closed and loss queueing networks, Math. Probl. Eng., 8 (2002), pp. 323-348.
44. M. LARSEN AND R. LYONS, Coalescing particles on an interval, J. Theoret. Probab., 12 (1999), pp. 201-205.
45. J. LERAY, Le calcul différentiel et intégral sur une variété analytique complexe, (Problème de Cauchy. III), Bull. Soc. Math. France, 87 (1959), pp. 81-180.
46. S.-Y. R. LI, A martingale approach to the study of occurrence of sequence patterns in repeated experiments, Ann. Probab., 8 (1980), pp. 1171-1176.
47. B. LICHTIN, The asymptotics of a lattice point problem associated to a finite number of polynomials. I, Duke Math. J., 63 (1991), pp. 139-192.
48. L. LIPSHITZ, The diagonal of a D-finite power series is D-finite, J. Algebra, 113 (1988), pp. 373-378.
49. M. LLADSER, Uniform formulae for coefficients of meromorphic functions in two variables. Part I, SIAM J. Discrete Math., 20 (2006), pp. 811-828.
50. M. LLADSER, Asymptotic Enumeration via Singularity Analysis, Ph.D. thesis, The Ohio State University, 2003.
51. M. E. LLADSER, P. POTOČNIK, J. ŠIAGIOVÁ, J. ŠIRÁcaN, AND M. C. WILSON, The diameter of random Cayley digraphs of given degree, Random Structures Algorithms, submitted (2006); available online from http://arriv.org.labs/0706.3539.
52. A. MEIR AND J. W. MOON, The asymptotic behaviour of coefficients of powers of certain generating functions, European J. Combin., 11 (1990), pp. 581-587.
53. D. MUMFORD, Algebraic Geometry. I, Classics Math., Springer-Verlag, Berlin, 1995.
54. E. MUNARINI AND N. ZAGAGLIA SALVI, Binary strings without zigzags, Sém. Lothar. Combin., 49 (2002/2004), article B49h (electronic); http://www.mat.univie.at/nsic/wpapers/s49/html.
55. A. M. ODLYZKO, Asymptotic enumeration methods, in Handbook of Combinatorics, Vols. 1, 2, Elsevier, Amsterdam, The Netherlands, 1995, pp. 1063-1229.
56. R. PEMANTLE, Generating functions with high-order poles are nearly polynomial, in Mathematics and Computer Science (Versailles, 2000), Trends Math., Birkhäuser, Basel, 2000, pp. 305-321.
57. R. PEMANTLE AND M. C. WILSON, Asymptotics of multivariate sequences. I. Smooth points of the singular variety, J. Combin. Theory Ser. A, 97 (2002), pp. 129-161.
58. R. PEMANTLE AND M. C. WILSON, Asymptotics of multivariate sequences. II. Multiple points of the singular variety, Combin. Probab. Comput., 13 (2004), pp. 735-761.
59. T. K. PETERSEN AND D. SPEYER, An arctic circle theorem for groves, J. Combin. Theory Ser. A, 111 (2005), pp. 137-164.
60. G. PÓLYA, On the number of certain lattice polygons, J. Combin. Theory, 6 (1969), pp. 102-105.
61. M. RÉGNIER AND F. TAHI, Generating functions in computational biology, J. Iranian Statist. Soc., to appear.
62. J. RIORDAN, Combinatorial Identities, John Wiley, New York, 1968.
63. D. G. ROGERS, Pascal triangles, Catalan numbers and renewal arrays, Discrete Math., 22 (1978), pp. 301-310.
64. L. W. SHAPIRO, S. GETU, W. J. WOAN, AND L. C. WOODSON, The Riordan group, Discrete Appl. Math., 34 (1991), pp. 229-239.
65. R. SPRUGNOLI, Riordan arrays and combinatorial sums, Discrete Math., 132 (1994), pp. 267-290.
66. R. P. STANLEY, Enumerative Combinatorics. Vol. 1, Cambridge Stud. Adv. Math. 49, Cambridge University Press, Cambridge, UK, 1997.
67. R. P. STANLEY, Enumerative Combinatorics. Vol. 2, Cambridge Stud. Adv. Math. 62, Cambridge University Press, Cambridge, UK, 1999.
68. B. STURMFELS, What is... a Gröbner basis?, Notices Amer. Math. Soc., 52 (2005), pp. 1199-1200.
69. J. VAN DER HOEVEN AND R. PEMANTLE, Automatic computation of asymptotics of coefficients of bivariate rational generating functions, in preparation.
70. M. S. WATERMAN, Applications of combinatorics to molecular biology, in Handbook of Combinatorics, Vols. 1, 2, Elsevier, Amsterdam, The Netherlands, 1995, pp. 1983-2001.
71. H. S. WILF, generatingfunctionology, 2nd ed., Academic Press, Boston, MA, 1994.
72. M.C. WILSON, Asymptotics for generalized Riordan arrays, in Proceedings of the 2005 International Conference on Analysis of Algorithms, Discrete Math. Theor. Comput. Sci. Proc., AD, Assoc. Discrete Math. Theor. Comput. Sci., Nancy, 2005, pp. 323-333 (electronic).