Open AccessAn explicit lower bound for the block complexity of an algebraic number
Author(s) -
Yann Bugeaud
Publication year - 2008
Publication title -
rendiconti lincei matematica e applicazioni
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.824
H-Index - 28
eISSN - 1720-0768
pISSN - 1120-6330
DOI - 10.4171/rlm/521
Subject(s) - mathematics , algebraic number , block (permutation group theory) , upper and lower bounds , algebra over a field , discrete mathematics , combinatorics , arithmetic , pure mathematics , mathematical analysis
Let b ≥ 2 be an integer andbe an irrational real number. Among other results, we establish an explicit lower bound for the number of distinct blocks of n digits occurring in the b-ary expansion of .
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom