GFUN: a Maple package for the manipulation of generating and holonomic functions in one variable

ABSTRACT

We describe the GFUN package which contains functions for manipulating sequences, linear recurrences, or differential equations and generating functions of various types. This article is intended both as an elementary introduction to the subject and as a reference manual for the package.

REFERENCES

• 1: BERGERON, F. AND PLOUFFE, S. 1992. Computing the generating function of a series given its first terms. J. Exp. Math. 1, 4, 308 312,
• 2: BOREL, E. 1901. Leqons sur les s~ries divergentes. In Collectwn de monograph~es sur la thdorie des fonctions, pubh& sous la &rectzon de M. Y~mde Borel. Gauthiers-Villars, Pans. Second ed. 1928 Reprinted by J. Gabay, 1988.
• 3: CANDELPERGHER, B. 1989. Une introduction h la r~surgence. Gazette des Mathdmaticiens 42 (Oct.), 36-64.
• 4: D. V. Chudnovsky , G. V. Chudnovsky, On expansion of algebraic functions in power and Puiseux series, II, Journal of Complexity, v.3 n.1, p.1-25, March 1987 [doi>10.1016/0885-064X(87)90002-1]
• 5: D V Chudnovsky , G V Chudnovsky, On expansion of algebraic functions in power and puiseux series, I, Journal of Complexity, v.2 n.4, p.271-294, Dec. 1986 [doi>10.1016/0885-064X(86)90006-3]
• 6: COMTET, L. 1974. Advanced Combinatorics. Reidel, Dordrecht, The Netherlands.
• 7: COMTET, L. 1964. Calcul pratique des coefficients de Taylor d'une fonction alg~brique. L'Enseignement Mathdmatique 10,267-270.
• 8: DELEST, M.-P. AND VIENNOT, G. 1984. Algebraic languages and polyominoes enumeration. Theor. Comput. Sct. 34, 1-2, 169-206.
• 9: DUVAL, D. 1987. Diverses questions relatives au calcul formel avec des nombres alg~briques. Doctorat d'l~tat, Universit~ scientifique, technologique et m~dicale de Grenoble.
• 10: GOURDON, X. AND SALVY, B. 1992. Asymptotics of linear recurrences with rational coefficients. Tech. Rep., INRIA, Le Chesnay Cedex, France.
• 11: Ronald L. Graham , Donald E. Knuth , Oren Patashnik, Concrete mathematics: a foundation for computer science, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989
• 12: GUTTMANN, A. J. AND ENTING, I.G. 1988. The number of convex polygons on the square and honeycomb lattices. J. Phys. A 21,467-474.
• 13: LIPSHITZ, L. 1989. D-finite power series. J. Alg. 122, 2, 353-373.
• 14: LODAY-RICHAUD, M. 1990. Introduction ~ la multisommabilit6. Gazette des Math~matie~ens 44, 41-63.
• 15: MALGRANGE, B. AND RAMIS, J.-P, 1992. Fonctions mu}tisommables. Annales de l'lnstitut Fourier 42, 1-2, 353-368.
• 16: SLOANE, N. J. A, 1973. A Handbook of Integer Sequences. Academic Press, New York.
• 17: STANLEY, R.P. 1980. Differentiably finite power series. Eur. J. Combinatorics 1,175-188.
• 18: THOMANN, J. 1990. Resommation des s6ries formelles. Solutions d'~quations diff~rentielles lin6aires du second ordre dans }e champ complexe au voisinage de singularities irr~guli~res. Numer. Math. 58, 5, 503-535.
• 19: Felix Ulmer, On Algebraic Solutions of Linear Differential Equations with Primitive Unimodular Galois Group, Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, p.446-455, October 07-11, 1991
• 20: WASOW, W. 1987. Asymptotic Expansions for Ordinary Differenttal Equattons. Dover, New York, 1965.
• 21: WmF, H.S. 1990. Generatingfuncttonology. Academic Press, New York.
• 22: Doron Zeilberger, A proof of Julian West's conjecture that the number of two-stack-sortable permutations of length n is 2(3n)!/((n+1)!(2n+1)!), Discrete Mathematics, v.102 n.1, p.85-93, May 18, 1992 [doi>10.1016/0012-365X(92)90351-F]
• 23: Doron Zeilberger, A holonomic systems approach to special functions identities, Journal of Computational and Applied Mathematics, v.32 n.3, p.321-368, Nov. 27, 1990 [doi>10.1016/0377-0427(90)90042-X]

INDEX TERMS

Primary Classification:
  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION

Additional Classification:
  G. Mathematics of Computing
  G.2 DISCRETE MATHEMATICS
      G.2.1 Combinatorics
          Subjects: Generating functions; Recurrences and difference equations

  I. Computing Methodologies
  I.1 SYMBOLIC AND ALGEBRAIC MANIPULATION
      I.1.3 Languages and Systems

          Nouns: Maple

General Terms:
Algorithms

Keywords:
computer algebra, generating functions, linear differential equations, linear recurrences