2000 character limit reached
On the expansion of some exponential periods in an integer base
Published 4 May 2012 in math.NT and math.CO | (1205.0961v1)
Abstract: We derive a lower bound for the subword complexity of the base-$b$ expansion ($b\geq 2$) 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.