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

We consider systems Al(t) y(ql t) + ... + A0(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.

[1]  O. Ore.  Theory of Non-Commutative Polynomials , 1933 .

[2]  Manuel Bronstein.  On Solutions of Linear Ordinary Difference Equations in their Coefficient Field , 2000, J. Symb. Comput..

[3]  Axel Riese,et al.  qMultiSum--a package for proving q-hypergeometric multiple summation identities , 2003, J. Symb. Comput..

[4]  Carsten Schneider,et al.  Denominator Bounds for Systems of Recurrence Equations using $ΠΣ$-Extensions , 2016, ArXiv.

[5]  H. Q. Le,et al.  Univariate Ore Polynomial Rings in Computer Algebra , 2005 .

[6]  Bruno Salvy,et al.  Non-Commutative Elimination in Ore Algebras Proves Multivariate Identities , 1998, J. Symb. Comput..

[7]  N. Jacobson,et al.  Pseudo-Linear Transformations , 1937 .

[8]  Johannes Middeke,et al.  A computational view on normal forms of matrices of Ore polynomials , 2012, ACCA.

[9]  Gilles Villard,et al.  Computing Popov and Hermite forms of polynomial matrices , 1996, ISSAC '96.

[10]  Sergei A. Abramov,et al.  Denominators of rational solutions of linear difference systems of an arbitrary order , 2012, Programming and Computer Software.

[11]  Andrej Bauer,et al.  Multibasic and Mixed Hypergeometric Gosper-Type Algorithms , 1999, J. Symb. Comput..

[12]  Moulay A. Barkatou,et al.  On Solution Spaces of Products of Linear Differential or Difference Operators , 2015, ACCA.

[13]  V. Popov.  Invariant Description of Linear, Time-Invariant Controllable Systems , 1972 .

[14]  Moulay A. Barkatou,et al.  Rational solutions of first order linear difference systems , 1998, ISSAC '98.

[15]  Christoph Koutschan,et al.  Advanced applications of the holonomic systems approach , 2010, ACCA.

[16]  Ralf Fröberg,et al.  An introduction to Gröbner bases , 1997, Pure and applied mathematics.

[17]  Sergei A. Abramov,et al.  A direct algorithm to compute rational solutions of first order linear q-difference systems , 2002, Discret. Math..

[18]  Alin Bostan,et al.  Complexity estimates for two uncoupling algorithms , 2013, ISSAC '13.

[19]  William Y. C. Chen,et al.  Converging to Gosper's algorithm , 2008, Adv. Appl. Math..

[20]  Moulay A. Barkatou,et al.  Rational solutions of matrix difference equations: the problem of equivalence and factorization , 1999, ISSAC '99.

[21]  Peter Paule,et al.  A Mathematica q-Analogue of Zeilberger's Algorithm Based on an Algebraically Motivated Approach to q-Hypergeometric Telescoping , 1991 .

[22]  George Labahn,et al.  Normal forms for general polynomial matrices , 2006, J. Symb. Comput..

[23]  Michael Karr,et al.  Summation in Finite Terms , 1981, JACM.

[24]  George Labahn,et al.  Fraction-free row reduction of matrices of Ore polynomials , 2006, J. Symb. Comput..

[25]  Moulay A. Barkatou,et al.  An algorithm for computing a companion block diagonal form for a system of linear differential equations , 1993, Applicable Algebra in Engineering, Communication and Computing.

[26]  Manuel Bronstein,et al.  An Introduction to Pseudo-Linear Algebra , 1996, Theor. Comput. Sci..

[27]  Sergei A. Abramov,et al.  q-Hypergeometric solutions of q-difference equations , 1998, Discret. Math..