Telescoping in the context of symbolic summation in Maple
DOI10.1016/J.JSC.2003.08.010zbMATH Open1137.05326OpenAlexW2072653231WikidataQ60712750 ScholiaQ60712750MaRDI QIDQ2643565FDOQ2643565
Authors: Yanyan Li 
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
Recommendations
- Computing the minimal telescoper for sums of hypergeometric terms
- On computing closed forms for indefinite summations
- Parallel computation and indefinite summation: A \(\|\text{MAPLE}\|\) application for the rational case
- Some open problems related to creative telescoping
- The method of creative telescoping
MapleZeilberger's algorithmhypergeometric termssymbolic summationclosed formsoftware designtelescoping sums
Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Cites Work
- HYP and HYPQ
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- Title not available (Why is that?)
- Title not available (Why is that?)
- Finite singularities and hypergeometric solutions of linear recurrence equations
- Title not available (Why is that?)
- Decision procedure for indefinite hypergeometric summation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Non-commutative elimination in Ore algebras proves multivariate identities
- On Zeilberger's algorithm and its \(q\)-analogue
- An extension of Zeilberger's fast algorithm to general holonomic functions
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Hypergeometric solutions of linear recurrences with polynomial coefficients
- Rational normal forms and minimal decompositions of hypergeometric terms
- The method of creative telescoping
- Greatest factorial factorization and symbolic summation
- Rational summation and Gosper-Petkovšek representation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multibasic and mixed hypergeometric Gosper-type algorithms
- Title not available (Why is that?)
- Telescoping in the context of symbolic summation in Maple
- When does Zeilberger's algorithm succeed?
- A criterion for the applicability of Zeilberger's algorithm to rational functions
- Minimal decomposition of indefinite hypergeometric sums
- Title not available (Why is that?)
- Integration of solutions of linear functional equations
- Analytic Solutions of Linear Difference Equations, Formal Series, and Bottom Summation
- Title not available (Why is that?)
- A direct algorithm to construct the minimal \(Z\)-pairs for rational functions.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- SumCracker: A package for manipulating symbolic sums and related objects
- In honour of Keith Geddes on his 60th birthday
- Trading order for degree in creative telescoping
- Title not available (Why is that?)
- Accelerating indefinite summation: simple classes of summands
- Parallel computation and indefinite summation: A \(\|\text{MAPLE}\|\) application for the rational case
- Title not available (Why is that?)
- On computing closed forms for indefinite summations
- A telescoping method for double summations
- Ore polynomial rings in one variable in computer algebra.
- Telescoping in the context of symbolic summation in Maple
- Implementation of a package of tools for manipulation of sums
- A Mathematica package for \(q\)-holonomic sequences and power series
- Computing the minimal telescoper for sums of hypergeometric terms
- Some open problems related to creative telescoping
Uses Software
This page was built for publication: Telescoping in the context of symbolic summation in Maple
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643565)
