Denominator Bounds for Systems of Recurrence Equations using ΠΣ-Extensions

04/30/2017
by   Johannes Middeke, et al.
0

We consider linear systems of recurrence equations whose coefficients are given in terms of indefinite nested sums and products covering, e.g., the harmonic numbers, hypergeometric products, q-hypergeometric products or their mixed versions. These linear systems are formulated in the setting of ΠΣ-extensions and our goal is to find a denominator bound (also known as universal denominator) for the solutions; i.e., a non-zero polynomial d such that the denominator of every solution of the system divides d. This is the first step in computing all rational solutions of such a rather general recurrence system. Once the denominator bound is known, the problem of solving for rational solutions is reduced to the problem of solving for polynomial solutions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/11/2020

On Rational and Hypergeometric Solutions of Linear Ordinary Difference Equations in Π^*-field extensions

We present a complete algorithm that computes all hypergeometric solutio...
research
07/06/2020

A Family of Denominator Bounds for First Order Linear Recurrence Systems

For linear recurrence systems, the problem of finding rational solutions...
research
05/11/2017

Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K

We consider systems A_ℓ(t) y(q^ℓ t) + ... + A_0(t) y(t) = b(t) of higher...
research
12/16/2016

Computing solutions of linear Mahler equations

Mahler equations relate evaluations of the same function f at iterated b...
research
08/02/2016

Rational Solutions of Underdetermined Polynomial Equations

In this paper we report on an application of computer algebra in which m...
research
09/01/2023

Effective equation solving, constraints and growth in virtually abelian groups

In this paper we study the satisfiability and solutions of group equatio...
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...

Please sign up or login with your details

Forgot password? Click here to reset