2002
DOI: 10.1016/s0012-365x(02)00442-9
|View full text |Cite
|
Sign up to set email alerts
|

A criterion for the applicability of Zeilberger's algorithm to rational functions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
24
0
1

Year Published

2012
2012
2023
2023

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 37 publications
(25 citation statements)
references
References 14 publications
0
24
0
1
Order By: Relevance
“…According to the different choices of L and ∂ x , we have nine types of telescopers in general, see Table 1. The existence problem of telescopers is related to the termination of Zeilbergerstyle algorithms and has been studied in [8,6,17,15] but, to our knowledge, our results concerning telescopers of the six types underlined in the above table are new. In this section, we will present a unified way to solve this problem for rational functions by using the knowledge in the previous sections.…”
Section: Telescopersmentioning
confidence: 97%
See 1 more Smart Citation
“…According to the different choices of L and ∂ x , we have nine types of telescopers in general, see Table 1. The existence problem of telescopers is related to the termination of Zeilbergerstyle algorithms and has been studied in [8,6,17,15] but, to our knowledge, our results concerning telescopers of the six types underlined in the above table are new. In this section, we will present a unified way to solve this problem for rational functions by using the knowledge in the previous sections.…”
Section: Telescopersmentioning
confidence: 97%
“…However, the situation in other cases turns out to be more involved. For the rational function f = 1/(t 2 +x 2 ), Abramov and Le [37,8] showed that there is no telescoper in k(t) S t such that L(f ) = ∆ x (g) for any g ∈ k(t, x). In other cases, there are two main reasons for non-existence: one is the non-commutativity between linear operators ∂ t ∈ {D t , S t , Q t } and residue mappings, the other is that not all algebraic functions would satisfy linear (q)-recurrence relations.…”
Section: Existence Of Telescopersmentioning
confidence: 99%
“…The notion creative telescoping was first coined by van der Poorten in his essay [92] on Apéry's proof of the irrationality of ζ (3). But certainly, the underlying principle was known and used long before as an ad hoc trick to tackle sums and integrals.…”
Section: History and Developmentsmentioning
confidence: 99%
“…The termination problem of Zeilberger's algorithms has been extensively studied in the last two decades (Wilf and Zeilberger, 1992b;Abramov and Le, 2002;Abramov, 2003;Chen et al, 2005) and can be related to existence problems for other operations, like the computation of diagonals (Lipshitz, 1988). The main output of creative telescoping is the recurrence on the sum U .…”
Section: Introductionmentioning
confidence: 99%
“…However, the situation in other cases turns out to be more involved. In the discrete case, the first complete solution to the termination problem has been given by Le (2001) and Abramov and Le (2002), by deciding whether telescopers exist for a given bivariate rational sequence in the (q)-discrete variables y 1 and y 2 . According to their criterion, the rational sequence f = 1 y 2 1 + y 2 2 has no telescoper.…”
Section: Introductionmentioning
confidence: 99%