On rational definite summation
Sergey P. Tsarev
Abstract
We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large class of sums S(n) = Σk=0n-1R(k,n).
Create a lesson
Related papers
Exact rational certificates and a Lean formalization of the eleven-variable Vasc inequality
Dakai Guo, Ruichen Qiu, Yichuan Cao et al.
RISR: Residual-Informed Scientific Equation Discovery with Large Language Models
Haobo Li, Wenshuo Zhang, Wenxiao Zhao et al.
A Finite Certificate for the Positive n=11 Vasc Inequality
Tiancheng Xu, Wensheng Yu
Parallel Integration over Simple Radical Extensions III: Antiderivatives in Terms of Special Functions
Sam Blake
Root isolation for analytic functions using cubic hermite interpolation
Christophe Raffalli
CPUNeSy: Controlling Model Writes for Reliable Neuro-Symbolic Reasoning
Zeyan Li, Siyuan Qiu, Shuai Zhao et al.