
arXiv: 1402.2409
The Apagodu-Zeilberger algorithm can be used for computing annihilating operators for definite sums over hypergeometric terms, or for definite integrals over hyperexponential functions. In this paper, we propose a generalization of this algorithm which is applicable to arbitrary $\partial$-finite functions. In analogy to the hypergeometric case, we introduce the notion of proper $\partial$-finite functions. We show that the algorithm always succeeds for these functions, and we give a tight a priori bound for the order of the output operator.
Computer Science - Symbolic Computation, FOS: Computer and information sciences, Symbolic Computation (cs.SC), I.1.2
Computer Science - Symbolic Computation, FOS: Computer and information sciences, Symbolic Computation (cs.SC), I.1.2
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 14 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
