Summation Theory II: Characterizations of $\boldsymbol{RΠΣ^*}$-extensions and algorithmic aspects
Preprint
Abstract
Recently, $R\Pi\Sigma^*$-extensions have been introduced which extend Karr's $\Pi\Sigma^*$-fields substantially: one can represent expressions not only in terms of transcendental sums and products, but one can work also with products over primitive roots of unity. Since one can solve the parameterized telescoping problem in such rings, covering as special cases the summation paradigms of telescoping and creative telescoping, one obtains a rather flexible toolbox for symbolic summation. This article is the continuation of this work. Inspired by Singer's Galois theory of difference equations we will work out several alternative characterizations of $R\Pi\Sigma^*$-extensions: adjoining naively sums and products leads to an $R\Pi\Sigma^*$-extension iff the obtained difference ring is simple iff the ring can be embedded into the ring of sequences iff the ring can be given by the interlacing of $\Pi\Sigma^*$-extensions. From the viewpoint of applications this leads to a fully automatic machinery to represent indefinite nested sums and products in such $R\Pi\Sigma^*$-rings. In addition, we work out how the parameterized telescoping paradigm can be used to prove algebraic independence of indefinite nested sums. Furthermore, one obtains an alternative reduction tactic to solve the parameterized telescoping problem in basic $R\Pi\Sigma^*$-extensions exploiting the interlacing property.Keywords
All Related Versions
This publication has 38 references indexed in Scilit:
- Parameterized Telescoping Proves Algebraic Independence of SumsAnnals of Combinatorics, 2010
- Structural theorems for symbolic summationApplicable Algebra in Engineering, Communication and Computing, 2009
- On Solutions of Linear Ordinary Difference Equations in their Coefficient FieldJournal of Symbolic Computation, 2000
- Multibasic and Mixed Hypergeometric Gosper-Type AlgorithmsJournal of Symbolic Computation, 1999
- Solving Difference Equations in Finite TermsJournal of Symbolic Computation, 1999
- Gröbner Bases for Ideals in Laurent Polynomial Rings and their Application to Systems of Difference EquationsApplicable Algebra in Engineering, Communication and Computing, 1999
- A Mathematica Version of Zeilberger's Algorithm for Proving Binomial Coefficient IdentitiesJournal of Symbolic Computation, 1995
- Greatest Factorial Factorization and Symbolic SummationJournal of Symbolic Computation, 1995
- An algorithmic proof theory for hypergeometric (ordinary and “q”) multisum/integral identitiesInventiones Mathematicae, 1992
- On finite generation of unit groups of commutative group ringsArchiv der Mathematik, 1983