The paper introduces new, mostly proven hypergeometric series for log 2, log 3, and log 5 with lower binary splitting costs than Machin-type formulas, plus a variable-p family.
Reduction-Based Creative Telescoping for Definite Summation of D-finite Functions
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Creative telescoping is an algorithmic method initiated by Zeilberger to compute definite sums by synthesizing summands that telescope, called certificates. We describe a creative telescoping algorithm that computes telescopers for definite sums of D-finite functions as well as the associated certificates in a compact form. The algorithm relies on a discrete analogue of the generalized Hermite reduction, or equivalently, a generalization of the Abramov-Petkov\v{s}ek reduction. We provide a Maple implementation with good timings on a variety of examples.
citation-role summary
citation-polarity summary
fields
math.NT 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Fast Ramanujan-type Series for Logarithms. Part I
The paper introduces new, mostly proven hypergeometric series for log 2, log 3, and log 5 with lower binary splitting costs than Machin-type formulas, plus a variable-p family.