2008Acta ArithmeticaOpen access

On two notions of complexity of algebraic numbers

Yann Bugeaud, Jan‐Hendrik Evertse

Open full text 25 citations

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 version of the Quantitative Subspace Theorem by Evertse and Schlickewei [14], Theorem 2.1.

Open-access reader

About this research paper

What this paper is about

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 version of the Quantitative Subspace Theorem by Evertse and Schlickewei [14], Theorem 2.1.

Why it matters

OpenAlex reports 25 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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 version of the Quantitative Subspace Theorem by Evertse and Schlickewei [14], Theorem 2.1.

Key concepts: Irrational number, Mathematics, Algebraic number, Block (permutation group theory), Subspace topology, Discrete mathematics, Algebra over a field, Arithmetic

Related papers

Back to paper searchBrowse research topicsOriginal source
On two notions of complexity of algebraic numbers — Research Paper | ScholarLens