Telescoping in the context of symbolic summation in Maple
From MaRDI portal
Publication:2643565
DOI10.1016/j.jsc.2003.08.010zbMath1137.05326OpenAlexW2072653231WikidataQ60712750 ScholiaQ60712750MaRDI QIDQ2643565
Publication date: 24 August 2007
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2003.08.010
Maplesoftware designZeilberger's algorithmhypergeometric termssymbolic summationclosed formtelescoping sums
Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items
Telescoping in the context of symbolic summation in Maple, Trading order for degree in creative telescoping, SumCracker: A package for manipulating symbolic sums and related objects, Ore polynomial rings in one variable in computer algebra., Accelerating indefinite summation: simple classes of summands, In honour of Keith Geddes on his 60th birthday, A telescoping method for double summations, A Mathematica package for \(q\)-holonomic sequences and power series
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational normal forms and minimal decompositions of hypergeometric terms
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- The method of creative telescoping
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- Non-commutative elimination in Ore algebras proves multivariate identities
- Finite singularities and hypergeometric solutions of linear recurrence equations
- On Zeilberger's algorithm and its \(q\)-analogue
- A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
- When does Zeilberger's algorithm succeed?
- A criterion for the applicability of Zeilberger's algorithm to rational functions
- Greatest factorial factorization and symbolic summation
- Rational summation and Gosper-Petkovšek representation
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- HYP and HYPQ
- Multibasic and mixed hypergeometric Gosper-type algorithms
- An extension of Zeilberger's fast algorithm to general holonomic functions
- Telescoping in the context of symbolic summation in Maple
- Minimal decomposition of indefinite hypergeometric sums
- Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation
- Decision procedure for indefinite hypergeometric summation
- Integration of solutions of linear functional equations