Telescoping Algorithms for $Σ^*$-Extensions via Complete Reductions
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913888065290240 |
|---|---|
| author | Chen, Shaoshi Gao, Yiman Huang, Hui Schneider, Carsten |
| author_facet | Chen, Shaoshi Gao, Yiman Huang, Hui Schneider, Carsten |
| contents | A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is equal to zero. In this paper, we present a complete reduction in a tower of $Σ^*$-extensions that turns to a new efficient framework for the parameterized telescoping problem. Special instances of such $Σ^*$-extensions cover iterative sums such as the harmonic numbers and generalized versions that arise, e.g., in combinatorics, computer science or particle physics. Moreover, we illustrate how these new ideas can be used to reduce the depth of the given sum and provide structural theorems that connect complete reductions to Karr's Fundamental Theorem of symbolic summation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_08767 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Telescoping Algorithms for $Σ^*$-Extensions via Complete Reductions Chen, Shaoshi Gao, Yiman Huang, Hui Schneider, Carsten Symbolic Computation A complete reduction on a difference field is a linear operator that enables one to decompose an element of the field as the sum of a summable part and a remainder such that the given element is summable if and only if the remainder is equal to zero. In this paper, we present a complete reduction in a tower of $Σ^*$-extensions that turns to a new efficient framework for the parameterized telescoping problem. Special instances of such $Σ^*$-extensions cover iterative sums such as the harmonic numbers and generalized versions that arise, e.g., in combinatorics, computer science or particle physics. Moreover, we illustrate how these new ideas can be used to reduce the depth of the given sum and provide structural theorems that connect complete reductions to Karr's Fundamental Theorem of symbolic summation. |
| title | Telescoping Algorithms for $Σ^*$-Extensions via Complete Reductions |
| topic | Symbolic Computation |
| url | https://arxiv.org/abs/2506.08767 |