The method of coefficients

American Mathematical Monthly

Volumn 114, Issue 1, 2007, Pages 40-57

  Merlini, Donatella ^a   Sprugnoli, Renzo ^a   Verri, Maria Cecilia ^a  

^a UNIVERSITY OF FLORENCE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33846494238     PISSN: 00029890     EISSN: None     Source Type: Journal    
DOI: 10.1080/00029890.2007.11920390     Document Type: Review

References (28)

1. E. A. Bender, Asymptotic methods in enumeration, SIAM Review 16 (1974) 485-515.
2. T. J. I'A. Bromwich, An Introduction to the Theory of Infinite Series, Macmillan, London, 1931.
3. G. P. Egorychev, Integralnoe Predstavlenie i Vychislenie Kombinatornykh Summ. Izdat. "Nauka" Sibirsk. Otdel., Novosibirsk, 1977.
4. -, Integral Representation and the Computation of Combinatorial Sums (trans. H. H. McFadden). American Mathematical Society, Providence, 1984.
5. -, Algorithms of integral representation of combinatorial sums and their applications, Formal Power Series and Algebraic Combinatorics (Moscow, 2000), Springer-Verlag, Berlin, 2000, pp. 15-29.
6. R. W. Gosper, Decision procedure for indefinite hypergeometric summation, Proc. Nat. Acad. Sciences U.S.A. 75 (1978) 40-42.
7. I. P. Goulden and D. M. Jackson, Combinatorial Enumeration, Wiley, New York, 1983.
8. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, New York, 1989.
9. D. H. Greene and D. E. Knuth, Mathematics for the Analysis of Algorithms, Birkäuser, Boston, 1982.
10. P. Henrici, An algebraic proof of the Lagrange-Burmann formula, J. Math. Anal. Appl. 8 (1964) 218-224.
11. -, Applied and Computational Complex Analysis, I, Wiley, New York, 1988.
12. H. K. Hwang, Uniform asymptotics of some Abel sums arising in coding theory, Theoret. Comput. Sci. 263 (2001) 145-158.
13. x - 1, C. R. Acad. Sci. Paris 224 (1947), 323-324.
14. C. G. J. Jacobi, De resolutione aequationum per series infinitas, J. Reine Angew. Math. 6 (1830) 257-286.
15. D. E. Knuth, The Art of Computer Programming, 3 vols., Addison-Wesley, Reading, MA, 1973.
16. -, Bracket notation for the 'coefficient-of' operator, in A Classical Mind, Essays in Honour of C. A. R. Hoare, A. W. Roscoe, ed., Prentice-Hall, UK, 1994, pp. 247-258.
17. D. Merlini and R. Sprugnoli, A Riordan array proof of a curious identity, Integers 2 (2002) A8 (electronic).
18. C. Ó'Dúnlaing and L. Ericson, Enumeration of tree properties by naïve methods, Algorithms review 1, (1990) 119-124.
19. M. Petkovšek, H. S. Wilf, and D. Zeilberger, A=B, AK Peters, Natick, MA, 1996.
20. J. Riordan, An Introduction to Combinatorial Analysis, Wiley, New York, 1958.
21. I. Schur, Identities in the theory of power series, Amer. J. Math. 69 (1947) 14-26.
22. R. Sedgewick and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
23. L. W. Shapiro, S. Getu, W.-J. Woan, and L. Woodson, The Riordan group, Discrete Appl. Math. 34 (1991) 229-239.
24. R. Sprugnoli, Riordan arrays and combinatorial sums, Discrete Math. 132 (1994) 267-290.
25. -, Riordan arrays and the Abel-Gould identity, Discrete Math. 142 (1995) 213-233.
26. R. P. Stanley, Enumerative Combinatorics, vol. 1, Wadsworth, Cambridge, 1986.
27. -, Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999.
28. H. S. Wilf, Generatingfunctionology, Academic Press, Boston, 1990.