An explicit lower bound for the block complexity of an algebraic number

DOI10.4171/RLM/521zbMath1268.11099MaRDI QIDQ993423

Yann Bugeaud

Publication date: 19 September 2010

Published in: Atti della Accademia Nazionale dei Lincei. Classe di Scienze Fisiche, Matematiche e Naturali. Serie IX. Rendiconti Lincei. Matematica e Applicazioni (Search for Journal in Brave)

Full work available at URL: http://www.ems-ph.org/journals/show_abstract.php?issn=1120-6330&vol=19&iss=3&rank=6

zbMATH Keywords

transcendencecombinatorics on wordsSchmidt Subspace Theorem

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Approximation to algebraic numbers (11J68) Schmidt Subspace Theorem and applications (11J87)

Related Items (3)

A further improvement of the quantitative subspace theorem ⋮ Quantitative versions of the subspace theorem and applications ⋮ On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited

Cites Work

• Unnamed Item
• Transcendence of numbers with a low complexity expansion
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).
• On the complexity of algebraic numbers. I: Expansions in integer bases
• On two notions of complexity of algebraic numbers
• Mesures de transcendance et aspects quantitatifs de la méthode de Thue-Siegel-Roth-Schmidt
• A quantitative version of the Absolute Subspace Theorem
• Rank and symbolic complexity
• Examples of sequences of complexity less than \(2n\)

This page was built for publication: An explicit lower bound for the block complexity of an algebraic number