Denominator bounds for systems of recurrence equations using \(\Pi\Sigma\)-extensions (Q1716151): Difference between revisions

The auhtors 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 \(\Pi\Sigma\)-extensions and the 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. In the second section the authors present some basic properties of \(\Pi\Sigma\)-theory and the main result concerning the computation of the aperiodic part of a universal denominator of coupled systems in a \(\Pi\Sigma\)-extension is presented. After that, in Section 3 they present some basic facts on Ore polynomials which they use as an algebraic model for recurrence operators and introduce some basic definitions for matrices. With this set up, in Section 4 it is shown how the aperiodic part of a universal denominator can be calculated under the assumption that the coupled system is brought into particular regularised form. This regularisation is carried out in Section 6 which relies on a row reduction that is introduced in Section 5. Finally, in Section 7 some examples are given and the authors conclude in Section 8 with a general method that enables one to search for solutions in the setting of \(\Pi\Sigma\)-fields. For the entire collection see [Zbl 1391.33001].