A Family of Denominator Bounds for First Order Linear Recurrence Systems

by   Mark van Hoeij, et al.

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator bound. There are several bounds in the literature. The sharpest bound leads to polynomial solutions of lower degrees, but this advantage need not compensate for the time spent on computing that bound. To strike the best balance between sharpness of the bound versus CPU time spent obtaining it, we will give a family of bounds. The J'th member of this family is similar to (Abramov, Barkatou, 1998) when J=1, similar to (van Hoeij, 1998) when J is large, and novel for intermediate values of J, which give the best balance between sharpness and CPU time. The setting for our content bounds are systems τ(Y) = MY where τ is an automorphism of a UFD, and M is an invertible matrix with entries in its field of fractions. This setting includes the shift case, the q-shift case, the multi-basic case and others. We give two versions, a global version, and a version that bounds each entry separately.


page 1

page 2

page 3

page 4


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

We consider linear systems of recurrence equations whose coefficients ar...

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...

Quantum Lower Bound for a Tripartite Version of the Hidden Shift Problem

In this paper, we prove a polynomial lower bound of Ω(n^1/3) on the quan...

Bounding the Escape Time of a Linear Dynamical System over a Compact Semialgebraic Set

We study the Escape Problem for discrete-time linear dynamical systems o...

Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS

Vector Addition Systems with States (VASS) provide a well-known and fund...

A note about "Faster algorithms for computing Hong's bound on absolute positiveness" by K. Mehlhorn and S. Ray

We show that a linear-time algorithm for computing Hong's bound for posi...

A Special Homotopy Continuation Method For A Class of Polynomial Systems

A special homotopy continuation method, as a combination of the polyhedr...

Please sign up or login with your details

Forgot password? Click here to reset