Generatingfunctionology, third edition

Generatingfunctionology, Third Edition

Volumn , Issue , 2005, Pages 1-243

  Wilf, Herbert S ^a  

^a UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85055799729     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1201/b10576     Document Type: Book

References (49)

1. Andrews, George. The theory of partitions, Encycl. Math. Appl. vol. 2. Reading, MA: Addison-Wesley, 1976.
2. [Bei] Beissinger, Janet. “Factorization and enumeration of labeled combinatorial objects.” Ph.D. Dissertation, University of Pennsylvania, 1981.
3. Bender, Edward A. “Asymptotic methods in enumeration.” SIAM Review 16 (1974), 485–515.
4. Bender, E. A., and Goldman, J. R. “Enumerative uses of generating functions.” Indiana Univ. Math. J. 20 (1971), 753–764.
5. de Bruijn, N. G. Asymptotic Methods in Analysis. Amsterdam: North Holland, 1958.
6. Comtet, Louis. Advanced Combinatorics; The Art of Finite and Infinite Expansions. Boston, MA: D. Reidel Publ. Co., 1974.
7. Delest, M. P. “Generating functions for column-convex polyominoes.” J. Combinatorial Theory A 48 (1988), 12–31.
8. Delest, M. P. “Polyominoes and animals: some recent results.” J. Mathematical Chemistry 8 (1991), 3–18.
9. Delest, M. P. and Viennot, G. “Algebraic languages and polyominoes enumeration.” Theoretical Computer Science 34 (1984), 169–206.
10. Doubilet, P., Rota, G. C., and Stanley, R. P. “On the Foundations of Combinatorial Theory VI: The idea of generating function.” In Proc. Sixth Berkeley Symposium on Statistics and Probability, vol. II, pp. 267–318. Berkeley, CA: Univ. California Press, 1972.
11. Egorychev, G.P. Integral Representation and the Computation of Combinatorial Sums, Translations of Mathematical Monographs, 59. Providence, RI: American Mathematical Society, 1984.
12. Foata, D. La Série Génératrice Exponentielle dans les Problèmes d’Énumération. Montreal: Presses de l’Université de Montréal, 1971.
13. Foata, D. “A combinatorial proof of the Mehler formula.” J. Comb. Th. Ser. A 24 (1978), 367–376.
14. Foata, D. and Schützenberger, M. Théorie Géométrique des Polynômes Eulériens, Lecture Notes in Math. No. 138. Berlin: Springer-Verlag, 1970.
15. Fraenkel, Aviezri. “A characterization of exactly covering congruences.” Discrete Mathematics 4 (1973), 359–366.
16. Garsia, A. and Joni, S. A. “Composition sequences.” Commun. in Algebra 8 (1980), 1195–1266.
17. Gosper, R. William, Jr. “Decision procedures for indefinite hypergeometric summation.”’ Proc. Nat. Acad. Sci. U.S.A. 75 (1978), 40–42.
18. [Go] Gould, Henry W. Combinatorial Identities. Morgantown, WV, 1972.
19. Goulden, I. P. and Jackson, D. M. Combinatorial Enumeration. New York: John Wiley and Sons, 1983.
20. Graham, Ronald L., Knuth, Donald E., and Patashnik, Oren. Concrete Mathematics. Reading, MA: Addison-Wesley, 1989.
21. Greene, Daniel H. and Knuth, Donald E. Mathematics for the Analysis of Algorithms. Boston: Birkhäuser, 1982.
22. Hansen, E. R. A Table of Series and Products. Englewood Cliffs, NJ: Prentice-Hall, 1975.
23. Harary, F., Robinson, R. W., and Schwenk, A. J. “A twenty step algorithm for determining the asymptotic number of trees of various species.” J. Austral Math. Soc. Ser. A 20 (1975), 483–503.
24. Hayman, Walter. “A generalisation of Stirling’s formula.” Journal für die reine und angewandte Mathematik 196 (1956), 67–95.
25. Joyal, A. “Une théorie combinatoire des séries formelles.” Adv. Math. 42 (1981), 1–82.
26. Klarner, D. “Some results concerning polyominoes.” Fibonacci Quart. 3 (1965), 9-20.
27. Knuth, Donald E. The Art of Computer Programming, vol. 1: Fundamental Algorithms, 1968 (2nd ed. 1973); vol. 2: Seminumerical Algorithms, 1969 (2nd ed. 1981); vol. 3: Sorting and Searching, 1973. Reading, MA: Addison-Wesley.
28. Knuth, Donald E., and Wilf, Herbert S. “A short proof of Darboux’s lemma.” Applied Mathematics Letters 2 (1989), 139–140.
29. Koepf, Wolfram. “Power series in computer algebra.” J. Symb. Comp. 13:6 (1992), 581–603.
30. [MP] Moon, J. W. and Pullman, N. J. “The number of triangles in a triangular lattice.” Delta 3 (1973), 28–31.
31. Nijenhuis, Albert, and Wilf, Herbert S. “Representations of integers by linear forms in nonnegative integers.”’ J. Number Theory 4 (1970), 98–106.
32. Odlyzko, A. M. “Asymptotic enumeration methods.” in Handbook of Combinatorics, vol. 2, pp. 1063–1229. Amsterdam: Elsevier, 1996.
33. Petkovšek, Marko. “Finding closed-form solutions of difference equations by symbolic methods.” Ph.D. Dissertation, School of Computer Science, Carnegie Mellon University, CMU-CS-91-103, 1991.
34. [Po] Porubský, Stefan. Results and problems on covering systems of residue classes. Mitteilungen Mathem. Seminar Giessen 150, Selbstverlag Math. Inst., Giessen, 1981.
35. Rademacher, Hans, Lectures on Elementary Number Theory, New York: Blaisdell, 1964.
36. Riddell, R. J., and Uhlenbeck, G. E. “On the theory of the virial development of the equation of state of monatomic gases.” J. Chem. Phys. 21 (1953), 2056–2064.
37. Rota, Gian-Carlo, and Mullin, Ronald. “On the foundations of combinatorial theory, III.’ In Graph Theory and its Applications, pp. 167–213. Reading, MA: Academic Press, 1970.
38. Roy, Ranjan. “Binomial identities and hypergeometric series.” American Mathematical Monthly 94 (1987), 36–46.
39. Schützenberger, M. P. “Context-free languages and pushdown automata.” Information and Control 6 (1963), 246–264.
40. [St1] Stanley, Richard P. Enumerative Combinatorics. Monterey, CA: Wadsworth, 1986.
41. Stanley, Richard P. “Generating functions.” In MAA Studies in Combinatorics, Washington, DC: Mathematical Association of America, 1978.
42. Stanley, Richard P. “Exponential structures.” Studies in Appl. Math. 59 (1978), 78–82.
43. Szegö, Gabor. Orthogonal Polynomials. American Mathematical Society Colloquium Series Publication.Providence, RI: American Math. Society, 1967.
44. Wilf, Herbert S. Mathematics for the Physical Sciences. New York: John Wiley and Sons, 1962; reprinted by New York: Dover Publications, 1978.
45. [Wi2] Wilf, Herbert S. Algorithms and Complexity. Englewood Cliffs, NJ: Prentice Hall, 1986; Second edition, Wellesley, MA: A K Peters, 2002.
46. Wilf, Herbert S. “Three problems in combinatorial asymptotics.” J. Combinatorial Theory 35 (1983), 199–207.
47. Wilf, Herbert S., and Zeilberger, Doron. “Rational functions certify combinatorial identities.” J. Amer. Math. Soc. 3 (1990), 147–158.
48. Wilf, Herbert S., and Zeilberger, Doron. “An algorithmic proof theory for hypergeometric (ordinary and ‘q’) multisum/integral identities.” Inventiones Mathematicæ, 108 (1992), 575–633.
49. Znám, S., ‘A survey of covering systems of congruences.’ Acta Math. Univ. Comenian. 40–41 (1982), 59–72.