On two notions of complexity of algebraic numbers
arXiv:0709.1560 · doi:10.4064/aa133-3-3
Abstract
we derive new, improved lower bounds for the block complexity of an irrational algebraic number and for the number of digit changes in the b-ary expansion of an irrational algebraic number. To this end, we apply a quantitative version of the Subspace Theorem due to Evertse and Schlickewei (2002).
31 pages