Computing solutions of linear Mahler equations

From MaRDI portal
Publication:3177728

DOI10.1090/MCOM/3359zbMATH Open1393.39002arXiv1612.05518OpenAlexW2583658760MaRDI QIDQ3177728FDOQ3177728

Frédéric Chyzak, Thomas Dreyfus, Philippe Dumas, Marc Mezzarobba

Publication date: 1 August 2018

Published in: Mathematics of Computation (Search for Journal in Brave)

Abstract: Mahler equations relate evaluations of the same function f at iterated bth powers of the variable. They arise in particular in the study of automatic sequences and in the complexity analysis of divide-and-conquer algorithms. Recently, the problem of solving Mahler equations in closed form has occurred in connection with number-theoretic questions. A difficulty in the manipulation of Mahler equations is the exponential blow-up of degrees when applying a Mahler operator to a polynomial. In this work, we present algorithms for solving linear Mahler equations for series, polynomials, and rational functions, and get polynomial-time complexity under a mild assumption. Incidentally, we develop an algorithm for computing the gcrd of a family of linear Mahler operators.


Full work available at URL: https://arxiv.org/abs/1612.05518





Cites Work


Cited In (7)


   Recommendations





This page was built for publication: Computing solutions of linear Mahler equations

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