gfun

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 106 articles , 1 standard article )

Showing results 1 to 20 of 106.
Sorted by year (citations)

1 2 3 4 5 6 next

  1. Bostan, Alin; Lairez, Pierre; Salvy, Bruno: Multiple binomial sums (2017)
  2. Oliver, Kamilla; Prodinger, Helmut: Summations in Bernoulli’s triangles via generating functions (2017)
  3. Shalosh B. Ekhad, Mingjia Yang: Automated Proofs of Many Conjectured Recurrences in the OEIS made by R.J. Mathar (2017) arXiv
  4. Bostan, Alin; Bousquet-Mélou, Mireille; Kauers, Manuel; Melczer, Stephen: On 3-dimensional lattice walks confined to the positive octant (2016)
  5. Bostan, Alin; Chèze, Guillaume; Cluzeau, Thomas; Weil, Jacques-Arthur: Efficient algorithms for computing rational first integrals and Darboux polynomials of planar polynomial vector fields (2016)
  6. Tabbara, R.; Owczarek, A.L.; Rechnitzer, A.: An exact solution of three interacting friendly walks in the bulk (2016)
  7. Albert, Michael; Bousquet-Mélou, Mireille: Permutations sortable by two stacks in parallel and quarter plane walks (2015)
  8. Kauers, Manuel; Jaroschek, Maximilian; Johansson, Fredrik: Ore polynomials in Sage (2015)
  9. Koepf, Wolfram; Chiadjeu, Etienne Nana: Algorithmic approach for formal Fourier series (2015)
  10. Shalosh B. Ekhad, N. J. A. Sloane, Doron Zeilberger: A Meta-Algorithm for Creating Fast Algorithms for Counting ON Cells in Odd-Rule Cellular Automata (2015) arXiv
  11. Kauers, Manuel: Bounds for D-finite closure properties (2014)
  12. Shalosh B. Ekhad, Doron Zeilberger: Automatic Proofs of Asymptotic ABNORMALITY (and much more!) of Natural Statistics Defined on Catalan-Counted Combinatorial Families (2014) arXiv
  13. Beuchler, Sven; Pillwein, Veronika; Zaglmayr, Sabine: Sparsity optimized high order finite element functions for $H(\mathrmcurl)$ on tetrahedra (2013)
  14. Gerhold, Stefan; Kauers, Manuel; Koutschan, Christoph; Paule, Peter; Schneider, Carsten; Zimmermann, Burkhard: Computer-assisted proofs of some identities for Bessel functions of fractional order (2013)
  15. Kauers, Manuel: The holonomic toolkit (2013)
  16. Lorenz, William Andrew; Ponty, Yann: Non-redundant random generation algorithms for weighted context-free grammars (2013)
  17. Rosenkranz, M.; Korporal, A.: A noncommutative algebraic operational calculus for boundary problems (2013)
  18. van der Hoeven, Joris: Guessing singular dependencies (2013)
  19. Bousquet-Mélou, Mireille; Fusy, Éric; Préville-Ratelle, Louis-François: The number of intervals in the $m$-Tamari lattices (2012)
  20. Buchberger, Bruno; Rosenkranz, Markus: Transforming problems from analysis to algebra: a case study in linear boundary problems (2012)

1 2 3 4 5 6 next


Further publications can be found at: http://perso.ens-lyon.fr/bruno.salvy/?page_id=12