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

  • Yann Bugeaud

    Université de Strasbourg, France

Abstract

Let be an integer and be an irrational real number. Among other results, we establish an explicit lower bound for the number of distinct blocks of digits occurring in the -ary expansion of .

Cite this article

Yann Bugeaud, An explicit lower bound for the block complexity of an algebraic number. Atti Accad. Naz. Lincei Cl. Sci. Fis. Mat. Natur. 19 (2008), no. 3, pp. 229–235

DOI 10.4171/RLM/521