Covering numbers of rotations
For an irrational rotation, we use the symbolic dynamics on the sturmian coding to compute explicitly, according to the continued fraction approximation of the argument, the measure of the largest Rokhlin stack made with intervals, and the measure of the largest Rokhlin stack whose levels have one name for the coding. Each one of these measures is equal to one if and only if the argument has unbounded partial quotients. (C) 2000 Elsevier Science B.V. All rights reserved.
symbolic dynamics combinatorics on words arithmetics