2007
DOI: 10.4007/annals.2007.165.547
|View full text |Cite
|
Sign up to set email alerts
|

On the complexity of algebraic numbers I. Expansions in integer bases

Abstract: Let b ≥ 2 be an integer. We prove that the b-ary expansion of every irrational algebraic number cannot have low complexity. Furthermore, we establish that irrational morphic numbers are transcendental, for a wide class of morphisms. In particular, irrational automatic numbers are transcendental. Our main tool is a new, combinatorial transcendence criterion.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
192
0
11

Year Published

2007
2007
2020
2020

Publication Types

Select...
4
3
2

Relationship

3
6

Authors

Journals

citations
Cited by 140 publications
(215 citation statements)
references
References 38 publications
1
192
0
11
Order By: Relevance
“…So far the equality P(α, n) = q n is out of reach. By a result of Adamczewski and Bugeaud [1], we know that P(α, n)/n → ∞ as n → ∞ for each algebraic irrational number α. One among earlier results [7] implies that P(α, n) − n → ∞ as n → ∞.…”
Section: Be a Sequence Of Positive Integers Given By X Nmentioning
confidence: 99%
“…So far the equality P(α, n) = q n is out of reach. By a result of Adamczewski and Bugeaud [1], we know that P(α, n)/n → ∞ as n → ∞ for each algebraic irrational number α. One among earlier results [7] implies that P(α, n) − n → ∞ as n → ∞.…”
Section: Be a Sequence Of Positive Integers Given By X Nmentioning
confidence: 99%
“…See, for instance, [1] for a recent progress on the distribution of digits in the expansions of algebraic irrational numbers in base b ≥ 2.…”
Section: Belongs To S By Theorem 2(ii) All Irreducible Polynomials Omentioning
confidence: 99%
“…Their combinatorial transcendence criterion was subsequently considerably improved in [10] by means of the multidimensional extension of Roth's theorem established by W. M. Schmidt, commonly referred to as the Schmidt Subspace Theorem [30,31]. As shown in [4], this powerful criterion has many applications and yields among other things the transcendence of irrational real numbers whose expansion in some integer base can be generated by a finite automaton. The latter result was generalized in [8], where we gave transcendence measures for a large class of real numbers shown to be transcendental in [4].…”
Section: Introductionmentioning
confidence: 99%
“…As shown in [4], this powerful criterion has many applications and yields among other things the transcendence of irrational real numbers whose expansion in some integer base can be generated by a finite automaton. The latter result was generalized in [8], where we gave transcendence measures for a large class of real numbers shown to be transcendental in [4]. The key ingredient for the proof is then the Quantitative Subspace Theorem [32].…”
Section: Introductionmentioning
confidence: 99%