pith. sign in

arxiv: 1705.04188 · v1 · pith:3ZXA4DCMnew · submitted 2017-05-11 · 🧮 math.CO · cs.SC

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

classification 🧮 math.CO cs.SC
keywords casesolutionssystemsdenominatormethodorderpolynomialrational
0
0 comments X
read the original abstract

We consider systems A_\ell(t) y(q^\ell 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.