On two notions of complexity of algebraic numbers

DOI10.4064/aa133-3-3zbMath1236.11062arXiv0709.1560OpenAlexW2145035606MaRDI QIDQ3518668

Jan-Hendrik Evertse, Yann Bugeaud

Publication date: 8 August 2008

Published in: Acta Arithmetica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.1560

zbMATH Keywords

complexitytranscendenceQuantitative Subspace Theorem

Mathematics Subject Classification ID

Radix representation; digital problems (11A63) Approximation to algebraic numbers (11J68) Schmidt Subspace Theorem and applications (11J87)

Related Items (12)

VARIATIONS AROUND A PROBLEM OF MAHLER AND MENDÈS FRANCE ⋮ The digit exchanges in the rotational beta expansions of algebraic numbers ⋮ A further improvement of the quantitative subspace theorem ⋮ Quantitative versions of the subspace theorem and applications ⋮ On the quantitative subspace theorem ⋮ ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS ⋮ A new complexity function, repetitions in Sturmian words, and irrationality exponents of Sturmian numbers ⋮ ON MAHLER’S CLASSIFICATION OF -ADIC NUMBERS ⋮ Mahler's work on Diophantine equations and subsequent developments ⋮ An explicit lower bound for the block complexity of an algebraic number ⋮ Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance ⋮ Diophantine approximation of Mahler numbers

This page was built for publication: On two notions of complexity of algebraic numbers