English

Denominator Bounds for Systems of Recurrence Equations using $\Pi\Sigma$-Extensions

Symbolic Computation 2017-05-02 v1

Abstract

We 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, qq-hypergeometric products or their mixed versions. These linear systems are formulated in the setting of ΠΣ\Pi\Sigma-extensions and our goal is to find a denominator bound (also known as universal denominator) for the solutions; i.e., a non-zero polynomial dd such that the denominator of every solution of the system divides dd. 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.

Keywords

Cite

@article{arxiv.1705.00280,
  title  = {Denominator Bounds for Systems of Recurrence Equations using $\Pi\Sigma$-Extensions},
  author = {Johannes Middeke and Carsten Schneider},
  journal= {arXiv preprint arXiv:1705.00280},
  year   = {2017}
}