Journal article · 2026 · Open access

Mahler's method in several variables and finite automata

Boris Adamczewski, Colin Faverjon

Annals of Mathematics, 204(2), 455–533 · Published 1 September 2026 · DOI 10.4007/annals.2026.204.2.1

Open PDFView at the publisherCite this paper

In brief

“Mahler's method in several variables and finite automata” is a 2026 journal article by Boris Adamczewski and Colin Faverjon, published in Annals of Mathematics. OpenAlex counts 10 citations as of 18 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
10
Most cited in
2026 (7)
Field-weighted impact
11.52
References
64
Authors
2

Abstract

We develop a theory of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence, which also includes the possibility of dealing with several systems associated with sufficiently independent matrix transformations. Our main results go far beyond the existing literature, also surpassing those of two unpublished preprints the authors made available on the arXiv in 2018. The main new feature is that our results apply now without any restriction on the matrices defining the corresponding Mahler systems. As a consequence, we settle several problems concerning expansions of numbers in multiplicatively independent bases. For instance, we prove that no irrational real number can be automatic in two multiplicatively independent integer bases, and we give a new proof and a broad algebraic generalization of Cobham's theorem in automata theory. We also provide a new proof and a multivariate generalization of Nishioka's theorem, a landmark result in Mahler's method.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Adamczewski, B., & Faverjon, C. (2026). Mahler's method in several variables and finite automata. Annals of Mathematics, 204(2), 455–533. https://doi.org/10.4007/annals.2026.204.2.1

MLA 9

Adamczewski, Boris, and Colin Faverjon. “Mahler's method in several variables and finite automata.” Annals of Mathematics, vol. 204, no. 2, 2026, pp. 455–533. https://doi.org/10.4007/annals.2026.204.2.1.

Chicago

Adamczewski, Boris and Colin Faverjon. 2026. “Mahler's method in several variables and finite automata.” Annals of Mathematics 204 (2): 455–533. https://doi.org/10.4007/annals.2026.204.2.1.

Harvard

Adamczewski, B. and Faverjon, C. (2026) ‘Mahler's method in several variables and finite automata’, Annals of Mathematics, 204(2), pp. 455–533. doi:10.4007/annals.2026.204.2.1.

IEEE

B. Adamczewski and C. Faverjon, “Mahler's method in several variables and finite automata,” Annals of Mathematics, vol. 204, no. 2, pp. 455–533, 2026, doi: 10.4007/annals.2026.204.2.1.

BibTeX

@article{adamczewski2026mahler,
  title     = {{Mahler's method in several variables and finite automata}},
  author    = {Adamczewski, Boris and Faverjon, Colin},
  journal   = {Annals of Mathematics},
  year      = {2026},
  volume    = {204},
  number    = {2},
  pages     = {455--533},
  doi       = {10.4007/annals.2026.204.2.1},
  url       = {https://doi.org/10.4007/annals.2026.204.2.1}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202111
202322
202677

Its field-weighted citation impact is 11.52: it has been cited 11.52 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Physical Sciences › Computer Science › Computational Theory and Mathematics › semigroups and automata theory

  • several variables
  • finite automata
  • transcendence
  • algebraic independence
  • automatic sequences
  • Cobham's theorem

Work with this paper

Most-cited papers in Computer Science

All highly cited Computer Science papers

Questions about this paper

How do I cite this paper in APA style?

Adamczewski, B., & Faverjon, C. (2026). Mahler's method in several variables and finite automata. Annals of Mathematics, 204(2), 455–533. https://doi.org/10.4007/annals.2026.204.2.1

How many times has this paper been cited?

10 times, according to OpenAlex on 18 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.

Is this paper free to read?

Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.

Who wrote this paper?

Boris Adamczewski, Colin Faverjon.

What is the DOI of this paper?

10.4007/annals.2026.204.2.1, permanently at https://doi.org/10.4007/annals.2026.204.2.1. Sign in and open it from this page.

Bibliographic data from OpenAlex (CC0), last checked 18 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.