Extended rate, more GFUN
From MaRDI portal
Publication:548596
DOI10.1016/j.jsc.2011.01.004zbMath1218.68204arXivmath/0702086OpenAlexW1973886982WikidataQ60692245 ScholiaQ60692245MaRDI QIDQ548596
Waldemar Hebisch, Martin Rubey
Publication date: 29 June 2011
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0702086
interpolationdifferential equationscomputer algebrarecurrence relationssoftware package\(q\)-calculusguessing
Related Items
Counting Pop-Stacked Permutations in Polynomial Time, Unnamed Item, The computational challenge of enumerating high-dimensional rook walks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Recursiveness in matrix rational interpolation problems
- A multilinear operator for almost product evaluation of Hankel determinants
- A Mathematica package for \(q\)-holonomic sequences and power series
- Differentiably finite power series
- Advanced determinant calculus
- Bell numbers, their relatives, and algebraic differential equations
- Chromatic sums revisited
- The holonomic ansatz. I: Foundations and applications to lattice path counting
- Dave Robbins' art of guessing
- Critical exponents from nonlinear functional equations for partially directed cluster models
- Fraction-Free Computation of Matrix Rational Interpolants and Matrix GCDs
- Elliptic Modular Forms and Their Applications
- Proof of Ira Gessel's lattice path conjecture
- Computing the Generating Function of a Series Given Its First Few Terms
- Automatic Classification of Restricted Lattice Walks
- Algebraic approximants: a new method of series analysis
- Inhomogeneous differential approximants for power series
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- GFUN
- The complete generating function for Gessel walks is algebraic
