Minimal representations and algebraic relations for single nested products

11/12/2019
by   Carsten Schneider, et al.
0

Recently, it has been shown constructively how a finite set of hypergeometric products, multibasic hypergeometric products or their mixed versions can be modeled properly in the setting of formal difference rings. Here special emphasis is put on robust constructions: whenever further products have to be considered, one can reuse –up to some mild modifications– the already existing difference ring. In this article we relax this robustness criteria and seek for another form of optimality. We will elaborate a general framework to represent a finite set of products in a formal difference ring where the number of transcendental product generators is minimal. As a bonus we are able to describe explicitly all relations among the given input products.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/03/2017

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

In recent years, Karr's difference field theory has been extended to the...
research
03/14/2016

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

Recently, RΠΣ^*-extensions have been introduced which extend Karr's ΠΣ^*...
research
11/17/2020

Representation of hypergeometric products of higher nesting depths in difference rings

A non-trivial symbolic machinery is presented that can rephrase algorith...
research
02/02/2021

Term Algebras, Canonical Representations and Difference Ring Theory for Symbolic Summation

A general overview of the existing difference ring theory for symbolic s...
research
02/05/2021

Solving linear difference equations with coefficients in rings with idempotent representations

We introduce a general reduction strategy that enables one to search for...
research
06/12/2017

Refined Holonomic Summation Algorithms in Particle Physics

An improved multi-summation approach is introduced and discussed that en...
research
05/29/2019

An Algorithm for Computing Invariant Projectors in Representations of Wreath Products

We describe an algorithm for computing the complete set of primitive ort...

Please sign up or login with your details

Forgot password? Click here to reset