Finding telescopers with minimal depth for indefinite nested sum and product expressions
DOI10.1145/1073884.1073924zbMATH Open1360.68953OpenAlexW1992876100MaRDI QIDQ5262776FDOQ5262776
Authors: Carsten Schneider
Publication date: 16 July 2015
Published in: Proceedings of the 2005 international symposium on Symbolic and algebraic computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1073884.1073924
Symbolic computation and algebraic computation (68W30) Difference algebra (12H10) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Cited In (10)
- SumCracker: A package for manipulating symbolic sums and related objects
- Structural theorems for symbolic summation
- Solving parameterized linear difference equations in terms of indefinite nested sums and products
- A refined difference field theory for symbolic summation
- Summation theory. II: Characterizations of \(R {\Pi}{\Sigma}^{\ast}\)-extensions and algorithmic aspects
- Simplifying Multiple Sums in Difference Fields
- Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation
- Padé approximations to the logarithm II: Identities, recurrences, and symbolic computation
- Indefinite summation with unspecified summands
- Some open problems related to creative telescoping
This page was built for publication: Finding telescopers with minimal depth for indefinite nested sum and product expressions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5262776)