Fast coefficient computation for algebraic power series in positive characteristic

DOI10.2140/obs.2019.2.119arXiv1806.06543OpenAlexW3105406847MaRDI QIDQ6165860

Xavier Caruso, Philippe Dumas, Alin Bostan, Gilles Christol

Publication date: 2 August 2023

Published in: The Open Book Series (Search for Journal in Brave)

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

zbMATH Keywords

complexityalgorithmChristol's theoremalgebraic power series

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Computational methods for problems pertaining to field theory (12-08)

Related Items

Automata and finite order elements in the Nottingham group

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Intégration sur un cycle évanescent
• Solving structured linear systems with large displacement rank
• On expansion of algebraic functions in power and Puiseux series. I
• Algebraic elements in formal power series rings
• The ring of \(k\)-regular sequences
• Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
• Automatic sequences and curves over finite fields
• Algebraic functions over finite fields
• Fast Computation of the Nth Term of an Algebraic Series over a Finite Prime Field
• Suites algébriques, automates et substitutions
• All Algebraic Functions Can Be Computed Fast
• An Efficient Formula for Linear Recurrences
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator