The gfun package provides tools for determining and manipulating generating functions. You can perform computations with generating functions defined by equations. For example, given two generating functions defined by linear differential equations with polynomial coefficients, there is a procedure to compute the differential equation satisfied by their product. Each command in the gfun package can be accessed by using either the long form or the short form of the command name in the command calling sequence. As the underlying implementation of the gfun package is a module, it is also possible to use the form gfun:-command to access a command from the package. For more information, see Module Members.

References in zbMATH (referenced in 117 articles , 1 standard article )

Showing results 81 to 100 of 117.
Sorted by year (citations)
  1. Paule, Peter; Schneider, Carsten: Computer proofs of a new family of harmonic number identities. (2003)
  2. Banderier, Cyril; Flajolet, Philippe: Basic analytic combinatorics of directed lattice paths (2002)
  3. Fabijonas, Bruce R.: Laplace’s method on a computer algebra system with an application to the real valued modified Bessel functions (2002)
  4. Flajolet, P.; Hatzis, K.; Nikoletseas, S.; Spirakis, P.: On the robustness of interconnections in random graphs: a symbolic approach. (2002)
  5. Guttmann, Anthony J.; Vöge, Markus: Lattice paths: Vicious walkers and friendly walkers (2002)
  6. van der Hoeven, Joris: Relax, but don’t be too lazy (2002)
  7. Beckermann, Bernhard; Labahn, George: Fraction-free computation of matrix rational interpolants and matrix GCDs (2000)
  8. Beckermann, Bernhard; Labahn, George: Effective computation of rational approximants and interpolants (2000)
  9. Bergeron, François; Gascon, Francis: Counting Young tableaux of bounded height (2000)
  10. Fulmek, M.; Krattenthaler, C.: The number of rhombus tilings of a symmetric hexagon which contain a fixed rhombus on the symmetry axis. II (2000)
  11. Lercier, R.; Morain, F.: Computing isogenies between elliptic curves over (F_p^n) using Couveignes’s algorithm (2000)
  12. Litow, B.: On Hadamard square roots of unity (2000)
  13. Denise, Alain; Zimmermann, Paul: Uniform random generation of decomposable structures using floating-point arithmetic (1999)
  14. Evans, Ronald; Hollmann, Henk D. L.; Krattenthaler, Christian; Xiang, Qing: Gauss sums, Jacobi sums, and (p)-ranks of cyclic difference sets (1999)
  15. Flajolet, Philippe; Noy, Marc: Analytic combinatorics of non-crossing configurations (1999)
  16. Gauthier, Bruno: HYPERG: a Maple package for manipulating hypergeometric series (1999)
  17. Koepf, Wolfram: Software for the algorithmic work with orthogonal polynomials and special functions (1999)
  18. Krattenthaler, Christian: Advanced determinant calculus (1999)
  19. Ronveaux, A.; Zarzo, A.; Area, I.; Godoy, E.: Decomposition of polynomials with respect to the cyclic group of order (m) (1999)
  20. Chyzak, Frédéric; Salvy, Bruno: Non-commutative elimination in Ore algebras proves multivariate identities (1998)

Further publications can be found at: