Finding telescopers with minimal depth for indefinite nested sum and product expressions

Authors:
Carsten Schneider
Affiliations:
J. Kepler University, Linz, Austria
Venue:
Proceedings of the 2005 international symposium on Symbolic and algebraic computation
Year:
2005

Citing 4
Cited 3

A fast algorithm for proving terminating hypergeometric identities

Discrete Mathematics
Summation in Finite Terms

Journal of the ACM (JACM)
Symbolic summation with single-nested sum extensions

ISSAC '04 Proceedings of the 2004 international symposium on Symbolic and algebraic computation
Degree Bounds to Find Polynomial Solutions of Parameterized Linear Difference Equations in ΠΣ-Fields

Applicable Algebra in Engineering, Communication and Computing

Application of unspecified sequences in symbolic summation

Proceedings of the 2006 international symposium on Symbolic and algebraic computation
Symbolic summation with radical expressions

Proceedings of the 2007 international symposium on Symbolic and algebraic computation
A refined difference field theory for symbolic summation

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

We provide algorithms that find, in case of existence, indefinite nested sum extensions in which a (creative) telescoping solution can be expressed with minimal nested depth.