加载中…
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.

生成讲解博客的中文版本

生成AI智能校验的中文版本