Extended rate, more GFUN

DOI10.1016/J.JSC.2011.01.004zbMATH Open1218.68204arXivmath/0702086OpenAlexW1973886982WikidataQ60692245 ScholiaQ60692245MaRDI QIDQ548596FDOQ548596

Waldemar Hebisch, Martin Rubey

Publication date: 29 June 2011

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Abstract: We present a software package that guesses formulae for sequences of, for example, rational numbers or rational functions, given the first few terms. We implement an algorithm due to Bernhard Beckermann and George Labahn, together with some enhancements to render our package efficient. Thus we extend and complement Christian Krattenthaler's program Rate, the parts concerned with guessing of Bruno Salvy and Paul Zimmermann's GFUN, the univariate case of Manuel Kauers' Guess.m and Manuel Kauers' and Christoph Koutschan's qGeneratingFunctions.m.

Full work available at URL: https://arxiv.org/abs/math/0702086

zbMATH Keywords

interpolationdifferential equationssoftware packagecomputer algebra\(q\)-calculusrecurrence relationsguessing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• GFUN
• A Mathematica package for \(q\)-holonomic sequences and power series
• The holonomic ansatz. I: Foundations and applications to lattice path counting
• Differentiably finite power series
• Advanced determinant calculus
• Elliptic Modular Forms and Their Applications
• Bell numbers, their relatives, and algebraic differential equations
• Automatic Classification of Restricted Lattice Walks
• The complete generating function for Gessel walks is algebraic
• Proof of Ira Gessel's lattice path conjecture
• A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
• A multilinear operator for almost product evaluation of Hankel determinants
• Recursiveness in matrix rational interpolation problems
• Fraction-free computation of matrix rational interpolants and matrix GCDs
• Algebraic approximants: a new method of series analysis
• Critical exponents from nonlinear functional equations for partially directed cluster models
• Chromatic sums revisited
• Dave Robbins' art of guessing
• Computing the Generating Function of a Series Given Its First Few Terms
• Inhomogeneous differential approximants for power series

Cited In (6)

• Counting Pop-Stacked Permutations in Polynomial Time
• How to Guess a Generating Function
• The computational challenge of enumerating high-dimensional rook walks
• D-algebraic functions
• Title not available (Why is that?)
• Operations for D-algebraic functions

Uses Software

• gfun
• OEIS
• RATE
• Guess
• GuessHolo2
• qGeneratingFunctions

   Recommendations

• Title not available (Why is that?) 👍 👎
• Extending R 👍 👎
• Extended cuts 👍 👎
• Beyond the expanders 👍 👎
• Extended by Balk Metrics 👍 👎

This page was built for publication: Extended rate, more GFUN

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q548596)