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

DOI10.4171/RLM/521MaRDI QIDQ993423zbMATHFDO

Authors 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

combinatorics on wordstranscendenceSchmidt Subspace Theorem

Mathematics Subject Classification ID

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

Recommendations

• On two notions of complexity of algebraic numbers
• On the \(b\)-ary expansion of an algebraic number
• On the \(b\)-ary expansions of algebraic irrational numbers (survey)
• On the decimal expansion of algebraic numbers
• On the number of digit changes in base-\(b\) expansions of algebraic numbers

Cites work

• scientific article; zbMATH DE number 4118449 (Why is no real title available?)
• A quantitative version of the Absolute Subspace Theorem
• Examples of sequences of complexity less than \(2n\)
• On the complexity of algebraic numbers. I: Expansions in integer bases
• On two notions of complexity of algebraic numbers
• Rank and symbolic complexity
• Transcendence measures and quantitative aspects of the Thue-Siegel-Roth-Schmidt method
• Transcendence of numbers with a low complexity expansion
• Words whose complexity satisfies lim \(\frac{p(n)}{n} = 1\).

Cited in

(9)

• On the expansion of some exponential periods in an integer base
• On two notions of complexity of algebraic numbers
• A further improvement of the quantitative subspace theorem
• On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
• On the expansions of real numbers in two multiplicatively dependent bases
• On the decimal expansion of algebraic numbers
• On a result of Mahler on the decimal expansions of (nα)
• Quantitative versions of the subspace theorem and applications
• On patterns occurring in binary algebraic numbers

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

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