On the expansion of some exponential periods in an integer base

DOI10.1007/S00208-009-0391-ZzbMATH Open1247.11095arXiv1205.0961OpenAlexW2040939949MaRDI QIDQ2655152FDOQ2655152

Boris Adamczewski

Publication date: 22 January 2010

Published in: Mathematische Annalen (Search for Journal in Brave)

Abstract: We derive a lower bound for the subword complexity of the base-$b$ expansion ($bgeq2$) of all real numbers whose irrationality exponent is equal to 2. This provides a generalization of a theorem due to Ferenczi and Mauduit. As a consequence, we obtain the first lower bound for the subword complexity of the number $e$ and of some other transcendental exponential periods.

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

zbMATH Keywords

irrationality exponentsubword complexityDiophantine exponentexponential periodinteger base

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Measures of irrationality and of transcendence (11J82)

Cites Work

• Title not available (Why is that?)
• Simple continued fractions for some irrational numbers
• Automatic Sequences
• Title not available (Why is that?)
• On the complexity of algebraic numbers. I: Expansions in integer bases
• Initial powers of Sturmian sequences
• Diophantine properties of real numbers generated by finite automata
• Rational approximations to algebraic numbers
• Rational approximations to certain numbers
• Approximations to the logarithms of certain rational numbers
• The subword complexity of a class of infinite binary words
• Transcendence of numbers with a low complexity expansion
• On the complexity of algebraic numbers
• Rational approximations to algebraic numbers
• Dynamics forβ-shifts and Diophantine approximation
• Hurwitz continued fractions with confluent hypergeometric functions

Cited In (13)

• Lengths, periods and expansions of elements written with respect to a digit system over \(\mathbb F_q [x]\)
• Combinatorial structure of Sturmian words and continued fraction expansion of Sturmian numbers
• The critical exponent functions
• The critical exponent is computable for automatic sequences
• A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
• On the rational approximation to the Thue-Morse-Mahler numbers
• Variations around a problem of Mahler and Mendès France
• Binary words with a given Diophantine exponent
• Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
• Rational approximation to values of \(G\)-functions, and their expansions in integer bases
• On the computational complexity of algebraic numbers: the Hartmanis–Stearns problem revisited
• Non-zero digits in the expansion of irrational algebraic numbers in an integer base
• On the irrationality exponent of the regular paperfolding numbers

   Recommendations

• ON THE EXPANSIONS OF REAL NUMBERS IN TWO MULTIPLICATIVELY DEPENDENT BASES 👍 👎
• On the complexity of algebraic numbers. I: Expansions in integer bases 👍 👎
• On the expansions of real numbers in two integer bases 👍 👎
• An explicit lower bound for the block complexity of an algebraic number 👍 👎
• On the b-ary expansions of log (1 + 1/a) and e 👍 👎

This page was built for publication: On the expansion of some exponential periods in an integer base

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