Hahn series and Mahler equations: Algorithmic aspects
arXiv:2412.04928 · doi:10.1112/jlms.12945
Abstract
Many articles have recently been devoted to Mahler equations, partly because of their links with other branches of mathematics such as automata theory. Hahn series (a generalization of the Puiseux series allowing arbitrary exponents of the indeterminate as long as the set that supports them is well-ordered) play a central role in the theory of Mahler equations. In this paper, we address the following fundamental question: is there an algorithm to calculate the Hahn series solutions of a given linear Mahler equation? What makes this question interesting is the fact that the Hahn series appearing in this context can have complicated supports with infinitely many accumulation points. Our (positive) answer to the above question involves among other things the construction of a computable well-ordered receptacle for the supports of the potential Hahn series solutions.
References in corpus (8)
- Hypertranscendence and linear difference equations
- Hypertranscendence of solutions of Mahler equations
- Méthode de Mahler: relations linéaires, transcendance et applications aux nombres automatiques
- Computing solutions of linear Mahler equations
- The rational-transcendental dichotomy of Mahler functions
- Méthode de Mahler, transcendance et relations linéaires : aspects effectifs
- A height gap theorem for coefficients of Mahler functions
- An algorithm to recognize regular singular Mahler systems