First-order factors of linear Mahler operators

A Mahler operator of order \(r\ge 1\) is of the form \(\ell_r M^r +\cdots + \ell_1 M + \ell_0\) where \(\ell_0 , \ldots, \ell_r\) are in \(\mathbb K[x]\) and \(Mx =x^b M\) for some integer \(b \ge 2\). Such operators form a ring with this commutation rule.\N\NIn this paper, the authors present two algorithms for computing first-order right-hand factors of any given such Mahler operator. By a first-order right-hand factor, they mean an operator of the form \(M-u\) where \(u(x)\) is a ramified rational function, and moreover they assume \(\mathbb K\) to be a computable subfield of \(\mathbb C\). In other words, they develop algorithms for finding all formal infinite product solutions \(f\) of linear functional equations \(\ell_r(x) f(x^{b^b} ) + \cdots + \ell_1 (x) f (x^b) + \ell_0 (x) f (x) = 0\) with \(\ell_j(x)\in \mathbb K[x]\). For instance, the infinite product \(\prod_{j=0}^\infty(1-x^{2^j})\) is a solution of the first order Mahler operator \(M+(x-1)\), with \(b=2\). Such equations were first considered in 1929 by Mahler, who studied the transcendence properties of the values of their solutions at algebraic points when \(\mathbb K=\overline{\mathbb Q}\).\N\NTheir first algorithm is adapted from Petkovšek's celebrated algorithm for the analogous problem in the case of linear recurrences. Their second algorithm proceeds by computing a basis of generalized power series solutions of the functional equation and by using Hermite-Padé approximants to detect those linear combinations of the solutions that correspond to first-order factors. These algorithms are based on various recent works, in particular by the authors and also by Faverjon, Poulet, Roques on the structure of basis of solutions of Mahler equations.

Cites work

This page was built for publication: First-order factors of linear Mahler operators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7005502)