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

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

1 2 3 ... 6 7 8 next

  1. Noy, Marc; Requilé, Clément; Rué, Juanjo: On the expected number of perfect matchings in cubic planar graphs (2022)
  2. Prodinger, Helmut: Skew Dyck paths having no peaks at level 1 (2022)
  3. Baril, Jean-Luc; Burstein, Alexander; Kirgizov, Sergey: Pattern statistics in faro words and permutations (2021)
  4. Blomberg, Lars; Shannon, S. R.; Sloane, N. J. A.: Graphical enumeration and stained glass windows. I: Rectangular grids (2021)
  5. Bréhard, Florent: A symbolic-numeric validation algorithm for linear ODEs with Newton-Picard method (2021)
  6. Brimacombe, Chris; Corless, Robert M.; Zamir, Mair: Computation and applications of Mathieu functions: a historical perspective (2021)
  7. Chaudhuri, Anupam; Do, Norman: Generalisations of the Harer-Zagier recursion for 1-point functions (2021)
  8. Merlini, Donatella: On the square root of a Bell matrix (2021)
  9. Prodinger, Helmut: An elementary approach to solve recursions relative to the enumeration of S-Motzkin paths (2021)
  10. Thanatipanonda, Thotsaporn “Aek”; Zeilberger, Doron: A multi-computational exploration of some games of pure chance (2021)
  11. Banderier, Cyril; Marchal, Philippe; Wallner, Michael: Periodic Pólya urns, the density method and asymptotics of Young tableaux (2020)
  12. Bostan, A.; Krick, T.; Szanto, A.; Valdettaro, M.: Subresultants of ((x-\alpha)^m) and ((x-\beta)^n), Jacobi polynomials and complexity (2020)
  13. 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)
  14. Dahne, Joel; Salvy, Bruno: Computation of tight enclosures for Laplacian eigenvalues (2020)
  15. Giesbrecht, Mark; Haraldson, Joseph; Kaltofen, Erich: Computing approximate greatest common right divisors of differential polynomials (2020)
  16. Jiménez-Pastor, Antonio; Pillwein, Veronika; Singer, Michael F.: Some structural results on (\mathrmD^n)-finite functions (2020)
  17. Koepf, Wolfram: Orthogonal polynomials and computer algebra (2020)
  18. Koepf, Wolfram: Computer algebra, power series and summation (2020)
  19. 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)
  20. Bendkowski, Maciej; Lescanne, Pierre: On the enumeration of closures and environments with an application to random generation (2019)

1 2 3 ... 6 7 8 next


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