Extended rate, more GFUN

DOI10.1016/J.JSC.2011.01.004MaRDI QIDQ548596zbMATH OpenOpenAlexWikidataFDO

Authors 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

zbMATH Keywords

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

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

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.

Recommendations

• Extended rate, more GFUN
• Extending R
• Extended cuts
• Beyond the expanders
• Extended by Balk metrics

Cites work

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

Cited in

(7)

• Some D-finite and some possibly D-finite sequences in the OEIS
• How to Guess a Generating Function
• Counting Pop-Stacked Permutations in Polynomial Time
• The computational challenge of enumerating high-dimensional rook walks
• Extended rate, more GFUN
• D-algebraic functions
• Operations for D-algebraic functions

Describes a project that uses

Uses Software

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

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)