An algorithm for deciding zero equivalence of nested polynomially recurrent sequences

DOI10.1145/1240233.1240241zbMath1321.68534OpenAlexW2065374506MaRDI QIDQ2944555

Manuel Kauers

Publication date: 2 September 2015

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1240233.1240241

zbMATH Keywords

symbolic computationcombinatorial sequencesnested polynomially recurrent sequenceszero equivalence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Combinatorial identities, bijective combinatorics (05A19) Additive difference equations (39A10) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)

Related Items

Solving difference equations whose coefficients are not transcendental ⋮ SumCracker: A package for manipulating symbolic sums and related objects

Uses Software

• FGb
• gfun
• SumCracker
• OEIS
• GeneratingFunctions