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

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

1 2 3 ... 5 6 7 next

  1. Banderier, Cyril; Marchal, Philippe; Wallner, Michael: Periodic Pólya urns, the density method and asymptotics of Young tableaux (2020)
  2. Bostan, A.; Krick, T.; Szanto, A.; Valdettaro, M.: Subresultants of ((x-\alpha)^m) and ((x-\beta)^n), Jacobi polynomials and complexity (2020)
  3. Brisebarre, Nicolas; Joldeş, Mioara; Muller, Jean-Michel; Naneş, Ana-Maria; Picot, Joris: Error analysis of some operations involved in the Cooley-Tukey fast Fourier transform (2020)
  4. Dahne, Joel; Salvy, Bruno: Computation of tight enclosures for Laplacian eigenvalues (2020)
  5. Giesbrecht, Mark; Haraldson, Joseph; Kaltofen, Erich: Computing approximate greatest common right divisors of differential polynomials (2020)
  6. Jiménez-Pastor, Antonio; Pillwein, Veronika; Singer, Michael F.: Some structural results on (\mathrmD^n)-finite functions (2020)
  7. Koepf, Wolfram: Computer algebra, power series and summation (2020)
  8. Koepf, Wolfram: Orthogonal polynomials and computer algebra (2020)
  9. Banderier, Cyril; Krattenthaler, Christian; Krinik, Alan; Kruchinin, Dmitry; Kruchinin, Vladimir; Nguyen, David; Wallner, Michael: Explicit formulas for enumeration of lattice paths: basketball and the kernel method (2019)
  10. Bendkowski, Maciej; Lescanne, Pierre: On the enumeration of closures and environments with an application to random generation (2019)
  11. Jiménez-Pastor, Antonio: DD-finite functions in Sage (2019)
  12. Jiménez-Pastor, Antonio; Pillwein, Veronika: A computable extension for D-finite functions: DD-finite functions (2019)
  13. Pillwein, Veronika: On the positivity of the Gillis-Reznick-Zeilberger rational function (2019)
  14. Salvy, Bruno: Linear differential equations as a data structure (2019)
  15. Spiegelhofer, Lukas; Wallner, Michael: The Tu-Deng conjecture holds almost surely (2019)
  16. Barnard, Emily; Reading, Nathan: Coxeter-bicatalan combinatorics (2018)
  17. Huang, Hui; Kauers, Manuel: D-finite numbers (2018)
  18. Bacher, Axel; Bodini, Olivier; Jacquot, Alice: Efficient random sampling of binary and unary-binary trees via holonomic equations (2017)
  19. Bonichon, Nicolas; Bousquet-Mélou, Mireille; Dorbec, Paul; Pennarun, Claire: On the number of planar Eulerian orientations (2017)
  20. Bostan, Alin; Lairez, Pierre; Salvy, Bruno: Multiple binomial sums (2017)

1 2 3 ... 5 6 7 next


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