On the expansion of some exponential periods in an integer base
From MaRDI portal
Publication:2655152
Abstract: We derive a lower bound for the subword complexity of the base- expansion () 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 and of some other transcendental exponential periods.
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+\frac1a)\) and \(e\)
Cites work
- scientific article; zbMATH DE number 1687034 (Why is no real title available?)
- scientific article; zbMATH DE number 3191380 (Why is no real title available?)
- Approximations to the logarithms of certain rational numbers
- Automatic Sequences
- Diophantine properties of real numbers generated by finite automata
- Dynamics forβ-shifts and Diophantine approximation
- Hurwitz continued fractions with confluent hypergeometric functions
- Initial powers of Sturmian sequences
- On the complexity of algebraic numbers
- On the complexity of algebraic numbers. I: Expansions in integer bases
- Rational approximations to algebraic numbers
- Rational approximations to algebraic numbers
- Rational approximations to certain numbers
- Simple continued fractions for some irrational numbers
- The subword complexity of a class of infinite binary words
- Transcendence of numbers with a low complexity expansion
Cited in
(16)- Lengths, periods and expansions of elements written with respect to a digit system over \(\mathbb F_q [x]\)
- Binary words with a given Diophantine exponent
- The critical exponent functions
- The 2-adic, binary and decimal periods of \(1/3^k\) approach full complexity for increasing \(k\)
- Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
- On the \(b\)-ary expansions of \(\log(1+\frac1a)\) and \(e\)
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- On the rational approximation to the Thue-Morse-Mahler numbers
- Non-zero digits in the expansion of irrational algebraic numbers in an integer base
- Variations around a problem of Mahler and Mendès France
- On the expansions of real numbers in two multiplicatively dependent bases
- Combinatorial structure of Sturmian words and continued fraction expansion of Sturmian numbers
- On the irrationality exponent of the regular paperfolding numbers
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- Rational approximation to values of \(G\)-functions, and their expansions in integer bases
- Transcendence of numbers with an expansion in a subclass of complexity 2n + 1
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)