arXiv · 0709.1560
On two notions of complexity of algebraic numbers
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).
Explore related subjects
Keep this discovery
Yann Bugeaud, Jan-Hendrik Evertse. 2007-09-11. On two notions of complexity of algebraic numbers. https://doi.org/10.4064/aa133-3-3
Cite the original work for its findings. Save a collection to share your selection of sources.