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

05/11/2017
by   Johannes Middeke, et al.
0

We consider systems A_ℓ(t) y(q^ℓ t) + ... + A_0(t) y(t) = b(t) of higher order q-recurrence equations with rational coefficients. We extend a method for finding a bound on the maximal power of t in the denominator of arbitrary rational solutions y(t) as well as a method for bounding the degree of polynomial solutions from the scalar case to the systems case. The approach is direct and does not rely on uncoupling or reduction to a first order system. Unlike in the scalar case this usually requires an initial transformation of the system.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/11/2023

Rational Solutions of Parametric First-Order Algebraic Differential Equations

In this paper we give a procedure for finding rational solutions of a gi...
research
04/30/2017

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

We consider linear systems of recurrence equations whose coefficients ar...
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/04/2020

Rational Solutions of First Order Algebraic Ordinary Differential Equations

Let f(t, y,y')=∑_i=0^d a_i(t, y)y'^i=0 be a first order ordinary differe...
research
03/26/2018

Left-eigenvectors are certificates of the Orbit Problem

This paper investigates the connexion between the Kannan-Lipton Orbit Pr...
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
10/10/2022

Hierarchical Learning in Euclidean Neural Networks

Equivariant machine learning methods have shown wide success at 3D learn...

Please sign up or login with your details

Forgot password? Click here to reset