DeepAI AI Chat
Log In Sign Up

Towards a symbolic summation theory for unspecified sequences

by   Peter Paule, et al.
Johannes Kepler University Linz

The article addresses the problem whether indefinite double sums involving a generic sequence can be simplified in terms of indefinite single sums. Depending on the structure of the double sum, the proposed summation machinery may provide such a simplification without exceptions. If it fails, it may suggest a more advanced simplification introducing in addition a single nested sum where the summand has to satisfy a particular constraint. More precisely, an explicitly given parameterized telescoping equation must hold. Restricting to the case that the arising unspecified sequences are specialized to the class of indefinite nested sums defined over hypergeometric, multi-basic or mixed hypergeometric products, it can be shown that this constraint is not only sufficient but also necessary.


page 1

page 2

page 3

page 4


Representation of hypergeometric products of higher nesting depths in difference rings

A non-trivial symbolic machinery is presented that can rephrase algorith...

Summation Theory II: Characterizations of RΠΣ^*-extensions and algorithmic aspects

Recently, RΠΣ^*-extensions have been introduced which extend Karr's ΠΣ^*...

Representing (q--)hypergeometric products and mixed versions in difference rings

In recent years, Karr's difference field theory has been extended to the...

Parameter and Structure Learning in Nested Markov Models

The constraints arising from DAG models with latent variables can be nat...

The 4-Adic Complexity of A Class of Quaternary Cyclotomic Sequences with Period 2p

In cryptography, we hope a sequence over ℤ_m with period N having larger...

Symbolic Formulae for Linear Mixed Models

A statistical model is a mathematical representation of an often simplif...