On the complexity of algebraic numbers. I: Expansions in integer bases
From MaRDI portal
Publication:2642237
Abstract: Let be an integer. We prove that the -adic 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.
From the text: Let \(b\geq 2\) be an integer. In the present paper, we prove new results concerning both notions of complexity. Our Theorem 1 provides a sharper lower estimate for the complexity of the \(b\)-adic expansion of every irrational algebraic number. We are still far away from proving that such an expansion is normal, but we considerably improve upon the earlier known results. We further establish (Theorem 2) the conjecture of Loxton and van der Poorten, namely that irrational automatic numbers are transcendental. Our proof yields more general statements and allows us to confirm that irrational morphic numbers are transcendental, for a wide class of morphisms (Theorems 3 and 4). We derive Theorems 1 to 4 from a refinement (Theorem 5) of the combinatorial criterion from [\textit{S. Ferenczi} and \textit{C. Mauduit}, J. Number Theory 67, 146--161 (1997; Zbl 0895.11029)], that we obtain as a consequence of the Schmidt Subspace Theorem.
Recommendations
Cited in
(only showing first 100 items - show all)- Binary words with a given Diophantine exponent
- Algebraic irrational binary numbers cannot be fixed points of non-trivial constant length or primitive morphisms
- Transcendence of numbers with a low complexity expansion
- Semi-Galois categories. II: An arithmetic analogue of Christol's theorem
- Rational approximation to values of \(G\)-functions, and their expansions in integer bases
- On the complexity of algebraic numbers
- Nonnormality of Stoneham constants
- Transcendental series of reciprocals of Fibonacci and Lucas numbers
- How to prove that a sequence is not automatic
- Spectral theory of regular sequences
- Stieltjes continued fractions related to the paperfolding sequence and Rudin-Shapiro sequence
- On irrationality exponents of generalized continued fractions
- Mahler's method
- A Mahler miscellany
- On the complexity of the set of codings for self-similar sets and a variation on the construction of Champernowne
- Hankel determinants, Padé approximations, and irrationality exponents for p-adic numbers
- Continued fractions and transcendental numbers
- On the irrationality exponent of the regular paperfolding numbers
- Subword complexity and projection bodies
- On the complexity of algebraic numbers. II: Continued fractions
- On the expansion of some exponential periods in an integer base
- An experimental investigation of the normality of irrational algebraic numbers
- Symbol-to-symbol correlation function at the Feigenbaum point of the logistic map
- Abelian powers and repetitions in Sturmian words
- Hartmanis-Stearns Conjecture on Real Time and Transcendence
- Continued fractions with low complexity: transcendence measures and quadratic approximation
- Variations around a problem of Mahler and Mendès France
- Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion
- An analogue of Cobham’s theorem for fractals
- Transcendence of Thue-Morse p-adic continued fractions
- Real numbers of sublinear complexity: irrationality and transcendence measures
- Transcendence of generating functions whose coefficients are multiplicative
- Transcendence tests for Mahler functions
- Binary constant-length substitutions and Mahler measures of Borwein polynomials
- Rational digit systems over finite fields and Christol's theorem
- On the decimal expansion of algebraic numbers
- Galois groups and automatic numbers
- On two notions of complexity of algebraic numbers
- On patterns occurring in binary algebraic numbers
- ON INTEGER SEQUENCES GENERATED BY LINEAR MAPS
- Irrationality measures for some automatic real numbers
- Quantitative versions of the subspace theorem and applications
- ON THE CONTEXT-FREENESS OF THE θ-EXPANSIONS OF THE INTEGERS
- Pseudorandom number generator based on the Bernoulli map on cubic algebraic integers
- Number theoretic aspects of regular sequences
- A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers
- Subword complexity and finite characteristic numbers
- On the binary expansion of irrational algebraic numbers
- Fifty years of the spectrum problem: survey and new results
- On the computational complexity of algebraic numbers: the Hartmanis-Stearns problem revisited
- Entropy and recurrent dimensions of discrete dynamical systems given by \(p\)-adic expansions
- On the algebraicity of Thue-Morse and period-doubling continued fractions
- Applications of numerical systems to transcendental number theory
- Diophantine approximation of Mahler numbers
- On the beta-expansions of 1 and algebraic numbers for a Salem number beta
- On the independence of expansions of algebraic numbers in an integer base
- Squares and cubes in Sturmian sequences
- Explicit examples of p-adic numbers with prescribed irrationality exponent
- Transcendence and Diophantine approximation
- Dynamics forβ-shifts and Diophantine approximation
- On the quasi-periodic p-adic Ruban continued fractions
- Expansions of algebraic numbers
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- An arithmetical property of the real numbers generated by Thue-Morse sequence along squares
- Continued fractions in the field of 𝑝-adic numbers
- Transcendence criterion with \((\beta,\mathcal{A})\)-representations in some quadratic integer bases
- Diophantine approximations. Abstracts from the workshop held April 17--23, 2022
- Characterizations of families of morphisms and words via binomial complexities
- Initial nonrepetitive complexity of regular episturmian words and their Diophantine exponents
- (Non)Automaticity of number theoretic functions
- Linear independence of the real numbers generated by the square and cube subsequences of Thue-Morse
- Markoff-Lagrange spectrum of one-sided shifts
- Transcendence of certain sequences of algebraic numbers
- The Thue-Morse continued fractions in characteristic 2 are algebraic
- Non-zero digits in the expansion of irrational algebraic numbers in an integer base
- Using finite automata to compute the base-b representation of the golden ratio and other quadratic irrationals
- Computing the base-\(b\) representation of quadratic irrationals using automata
- Opacity complexity of automatic sequences: the general case
- A note on Mahler's theorem. II
- On transcendence of numbers related to Sturmian and Arnoux-Rauzy words
- The structure of trees in the pushdown hierarchy
- On the Nth 2-adic complexity of binary sequences identified with algebraic 2-adic integers
- On the decidability of monadic second-order logic with arithmetic predicates
- Decidability of the isomorphism problem between multidimensional substitutive subshifts
- Transcendence of Hecke-Mahler series
- Transcendence and normality of complex numbers via Hurwitz continued fractions
- On the finite factorial numbers
- Subspace Lang conjecture and some remarks on a transcendental criterion
- Concrete self-similar representations of some subgroups of the Baer-Specker group
- If a machine did it, it is probably transcendental (even p-adically)
- Tree representations of infinite words and their logical properties
- Automaticity of the Hankel determinants of difference sequences of the Thue-Morse sequence
- On the complexity of a family of \(k\)-context-free sequences
- On the joint subword complexity of automatic sequences
- On a sequence related to that of Thue-Morse and its applications
- Quadratic approximation to automatic continued fractions
- On complexity functions of infinite words associated with generalized Dyck languages
- On the b-ary expansion of an algebraic number
- Transcendence measures for continued fractions involving repetitive or symmetric patterns
- An explicit lower bound for the block complexity of an algebraic number
This page was built for publication: On the complexity of algebraic numbers. I: Expansions in integer bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2642237)
