Solving Linear Recurrence Equations with Polynomial Coefficients

DOI10.1007/978-3-7091-1616-6_11zbMath1312.65212OpenAlexW1918550976MaRDI QIDQ5244925

Helena Zakrajšek, Marko Petkovsek

Publication date: 1 April 2015

Published in: Texts & Monographs in Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-7091-1616-6_11

zbMATH Keywords

algorithmLiouvillian solutionspolynomial coefficientlinear recurrence equationd'Alembertian solutions

Mathematics Subject Classification ID

Numerical aspects of recurrence relations (65Q30)

Related Items (14)

Algebraic independence of sequences generated by (cyclotomic) harmonic sums ⋮ Refinements and generalizations of some inequalities of Shafer-fink's type for the inverse sine function ⋮ Convolutions of Liouvillian sequences ⋮ Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱ ⋮ Representation of hypergeometric products of higher nesting depths in difference rings ⋮ The factorial-basis method for finding definite-sum solutions of linear recurrences with polynomial coefficients ⋮ Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects ⋮ Refined estimates and generalizations of inequalities related to the arctangent function and Shafer's inequality ⋮ Solutions of linear recurrence equations ⋮ A difference ring theory for symbolic summation ⋮ Operator factorization and solution of second-order nonlinear difference equations with variable coefficients and multipoint constraints ⋮ On rational and hypergeometric solutions of linear ordinary difference equations in \(\Pi\Sigma^\ast\)-field extensions ⋮ Simplifying Multiple Sums in Difference Fields ⋮ Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation

This page was built for publication: Solving Linear Recurrence Equations with Polynomial Coefficients