GFUN
- 1 June 1994
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Mathematical Software
- Vol. 20 (2) , 163-177
- https://doi.org/10.1145/178365.178368
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.Keywords
This publication has 10 references indexed in Scilit:
- Effective asymptotics of linear recurrences with rational coefficientsDiscrete Mathematics, 1996
- A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)Discrete Mathematics, 1992
- Fonctions multisommablesAnnales de l'institut Fourier, 1992
- A holonomic systems approach to special functions identitiesJournal of Computational and Applied Mathematics, 1990
- D-finite power seriesJournal of Algebra, 1989
- The number of convex polygons on the square and honeycomb latticesJournal of Physics A: General Physics, 1988
- On expansion of algebraic functions in power and Puiseux series, IIJournal of Complexity, 1987
- On expansion of algebraic functions in power and Puiseux series, IJournal of Complexity, 1986
- Differentiably Finite Power SeriesEuropean Journal of Combinatorics, 1980
- Advanced CombinatoricsPublished by Springer Nature ,1974