An explicit lower bound for the block complexity of an algebraic number
Yann Bugeaud · Rendiconti Lincei Matematica e Applicazioni · 2008
Let b \ge 2 be an integer and \xi be an irrational real number. Among other results, we establish an explicit lower bound for the number of distinct blocks of n digits occurring in the b -ary expansion of \xi .