arXiv Analytics

Sign in

arXiv:0709.1560 [math.NT]AbstractReferencesReviewsResources

On two notions of complexity of algebraic numbers

Yann Bugeaud, Jan-Hendrik Evertse

Published 2007-09-11Version 1

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).

Comments: 31 pages
Categories: math.NT
Subjects: 11J68, 11J61, 11J82
Related articles: Most relevant | Search more
arXiv:math/0103054 [math.NT] (Published 2001-03-08)
Lower bounds for the total stopping time of 3X+1 iterates
arXiv:1709.07170 [math.NT] (Published 2017-09-21)
On the explicit upper and lower bounds for the number of zeros of the Selberg class
arXiv:1702.07650 [math.NT] (Published 2017-02-24)
Lower Bounds for Maximum Gap in (Inverse) Cyclotomic Polynomials

Links

Toolbox