First-order factors of linear Mahler operators
Frédéric Chyzak, Thomas Dreyfus, Philippe Dumas, Marc Mezzarobba
TL;DR
This work develops two complete algorithms for factoring linear Mahler operators to obtain first-order right-hand factors, i.e., hypergeometric solutions, by relating factorization to Riccati Mahler equations. The first method extends Petkovšek’s Gosper–Petkovšek framework to Mahler operators; the second uses Hermite–Padé approximants to reconstruct ramified rational solutions from series data, producing parametrized candidate solutions that are then validated. A rigorous structural foundation is provided via a difference-ring framework, Puiseux and ramified-series solutions, and explicit degree- and ramification-bounds, enabling controlled searches and termination proofs. The authors implement and benchmark both approaches, showing that the HP-based reconstruction often outperforms the naive Petkovšek-style search, and apply the results to differential transcendence criteria for Mahler functions. The work thereby advances practical tools for analyzing Mahler equations, with implications for automatic sequences, transcendence theory, and differential-algebraic independence.
Abstract
We develop and compare two algorithms for computing first-order right-hand factors in the ring of linear Mahler operators$\ell_r M^r + \dots + \ell_1 M + \ell_0$where $\ell_0, \dots, \ell_r$ are polynomials in~$x$ and $Mx = x^b M$ for some integer $b \geq 2$. In other words, we give algorithms for finding all formal infinite product solutions of linear functional equations$\ell_r(x) f(x^{b^r}) + \dots + \ell_1(x) f(x^b) + \ell_0(x) f(x) = 0$. The first of our algorithms is adapted from Petkovšek's classical algorithm forthe analogous problem in the case of linear recurrences. The second one 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. We present implementations of both algorithms and discuss their use in combination with criteria from the literature to prove the differential transcendence of power series solutions of Mahler equations.
