Computing the algebraic relations of \(C\)-finite sequences and multisequences

DOI10.1016/j.jsc.2008.03.002zbMath1163.11084OpenAlexW2153757816MaRDI QIDQ2517807

Manuel Kauers, Burkhard Zimmermann

Publication date: 9 January 2009

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.03.002

zbMATH Keywords

algorithmrecurrence sequencealgebraic relation

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Recurrences (11B37)

Related Items (22)

AN EFFICIENT ALGORITHM FOR DERIVING SUMMATION IDENTITIES FROM MUTUAL RECURRENCES ⋮ The \(C\)-finite ansatz ⋮ Lonely points in simplices ⋮ From Polynomial Invariants to Linear Loops ⋮ Representation of hypergeometric products of higher nesting depths in difference rings ⋮ Solving invariant generation for unsolvable loops ⋮ On the computation of the Galois group of linear difference equations ⋮ Symbolic computation in automated program reasoning ⋮ Computing the binomial part of a polynomial ideal ⋮ Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects ⋮ Minimal representations and algebraic relations for single nested products ⋮ Aligator: A Mathematica Package for Invariant Generation (System Description) ⋮ Solving difference equations whose coefficients are not transcendental ⋮ A fast algorithm for computing multiplicative relations between the roots of a generic polynomial ⋮ Toric varieties from cyclic matrix semigroups ⋮ Construction of all polynomial relations among Dedekind eta functions of level \(N\) ⋮ Degree and Dimension Estimates for Invariant Ideals of $$P$$ -Solvable Recurrences ⋮ Reasoning Algebraically About P-Solvable Loops ⋮ Simplifying Multiple Sums in Difference Fields ⋮ Sums of products of generalized Fibonacci and Lucas numbers ⋮ Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation ⋮ The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals

Uses Software

• gfun
• RComp
• OEIS
• Dependencies

Cites Work

• A holonomic systems approach to special functions identities
• Gröbner bases of lattices, corner polyhedra, and integer programming
• RComp: A \textit{Mathematica} package for computing with recursive sequences
• Summation in Finite Terms
• GFUN
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the algebraic relations of \(C\)-finite sequences and multisequences