DeepAI AI Chat
Log In Sign Up

Representation of hypergeometric products of higher nesting depths in difference rings

by   Evans Doe Ocansey, et al.

A non-trivial symbolic machinery is presented that can rephrase algorithmically a finite set of nested hypergeometric products in appropriately designed difference rings. As a consequence, one obtains an alternative representation in terms of one single product defined over a root of unity and nested hypergeometric products which are algebraically independent among each other. In particular, one can solve the zero-recognition problem: the input expression of nested hypergeometric products evaluates to zero if and only if the output expression is the zero expression. Combined with available symbolic summation algorithms in the setting of difference rings, one obtains a general machinery that can represent (and simplify) nested sums defined over nested products.


page 1

page 2

page 3

page 4


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

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

Towards a symbolic summation theory for unspecified sequences

The article addresses the problem whether indefinite double sums involvi...

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

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

Minimal representations and algebraic relations for single nested products

Recently, it has been shown constructively how a finite set of hypergeom...

Nested sampling statistical errors

Nested sampling (NS) is a popular algorithm for Bayesian computation. We...

Computing Mellin representations and asymptotics of nested binomial sums in a symbolic way: the RICA package

Nested binomial sums form a particular class of sums that arise in the c...

Refined Holonomic Summation Algorithms in Particle Physics

An improved multi-summation approach is introduced and discussed that en...