Fast Algorithms for Refined Parameterized Telescoping in Difference Fields

Carsten Schneider

Fast Algorithms for Refined Parameterized Telescoping in Difference Fields

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1307.7887 v2 pith:IYSBZTKF submitted 2013-07-30 cs.SC

Carsten Schneider This is my paper

classification cs.SC

keywords telescopingfieldsalgorithmsdifferenceparameterizedrefinedsigmaversions

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

abstract

Parameterized telescoping (including telescoping and creative telescoping) and refined versions of it play a central role in the research area of symbolic summation. Karr introduced 1981 $\Pi\Sigma$-fields, a general class of difference fields, that enables one to consider this problem for indefinite nested sums and products covering as special cases, e.g., the ($q$--)hypergeometric case and their mixed versions. This survey article presents the available algorithms in the framework of $\Pi\Sigma$-extensions and elaborates new results concerning efficiency.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Telescoping Algorithms for $\Sigma^*$-Extensions via Complete Reductions
cs.SC 2025-06 conditional novelty 7.0 of 10

Complete reductions can be built recursively in towers of Sigma*-extensions, yielding faster refined and parameterized telescoping algorithms for nested harmonic sums.

Pith tools