Computing solutions of linear Mahler equations
From MaRDI portal
Publication:3177728
DOI10.1090/mcom/3359zbMath1393.39002arXiv1612.05518OpenAlexW2583658760MaRDI QIDQ3177728
Thomas Dreyfus, Marc Mezzarobba, Frédéric Chyzak, Philippe Dumas
Publication date: 1 August 2018
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.05518
Symbolic computation and algebraic computation (68W30) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10) Linear difference equations (39A06)
Related Items (3)
An algorithm to recognize regular singular Mahler systems ⋮ Frobenius method for Mahler equations ⋮ Mahler's method
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Complexity of factoring and calculating the GCD of linear ordinary differential operators
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- Rational solutions of linear difference and \(q\)-differential equations with polynomial coefficients
- On solutions of linear ordinary difference equations in their coefficient field
- Relax, but don't be too lazy
- Mahler functions and transcendence
- Fast computation of special resultants
- Transcendence tests for Mahler functions
- Two Notes on Formal Power Series
- Suites algébriques, automates et substitutions
- A generalization of the fast LUP matrix decomposition algorithm and applications
- On the algebraic relations between Mahler functions
- Méthode de Mahler : relations linéaires, transcendance et applications aux nombres automatiques
- Rational solutions of linear differential and difference equations with polynomial coefficients
This page was built for publication: Computing solutions of linear Mahler equations
