Related papers: Coding rotations on intervals

Let $R_\alpha$ be an irrational rotation of the circle, and code the orbit of any point $x$ by whether $R_\alpha^i(x)$ belongs to $[0,\alpha)$ or $[\alpha,1)$ -- this produces a Sturmian sequence. A point is undetermined at step $j$ if its…

In this article we present an efficient algorithm to compute rotation intervals of circle maps of degree one. It is based on the computation of the rotation number of a monotone circle map of degree one with a constant section. The main…

Let $0<\lambda<1$. We consider the one-parameter family of circle $\lambda$-affine contractions $f_\delta:x \in [0,1) \mapsto \lambda x + \delta \; {\rm mod}\,1 $, where $0 \le \delta <1$. Let $\rho$ be the rotation number of the map…

This paper describes the probabilistic behaviour of a random Sturmian word. It performs the probabilistic analysis of the recurrence function which can be viewed as a waiting time to discover all the factors of length $n$ of the Sturmian…

Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…

We consider $m\times n$ rectangular matrices formed from Sturmian words with slope $\alpha$, and we fully characterise their balance properties in terms of the Ostrowski representations of $m$ and $n$ with respect to $\alpha$. This…

We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the precise asymptotics for it, which happens to be O(n^4). The…

We consider rotations on the torus $\mathbb{T}^2$, and we classify them with respect to the complexity functions. In dimension one, a minimal rotation can be coded by a sturmian word. A sturmian word has complexity $n+1$ by the…

We study properties of an array of numbers, called "the triangle," in which each row is formed by rotating all the numbers in the previous row to the left by $m$ positions in cyclical fashion, then appending a number to the end of the row.…

We introduce the notion of $\alpha$-numbers and formal intercept of sturmian words, and derive from this study general factorisations formula for sturmian words. Sturmian words are defined as infinite words with lowest unbound complexity,…

Let $b\ge 2$ be an integer. Using Sturmian words we describe all irrational real numbers $\xi$ such that the image in $\mathbb{R}/\mathbb{Z}$ of the sequence $(\xi (-b)^n)_{n\ge 0}$ is contained in an interval of length…

We consider a symbolic coding of linear trajectories in the regular octagon with opposite sides identified (and more generally in regular 2n-gons). Each infinite trajectory gives a cutting sequence corresponding to the sequence of sides…

In this paper, we analyze the periodic factors of Sturmian words for the findings to lead to a linear-time algorithm for the computation of runs in this class of words which, to our best knowledge, is an open problem in literature.

For a continuous map on a topological graph containing a unique loop S it is possible to define the degree and, for a map of degree 1, rotation numbers. It is known that the set of rotation numbers of points in S is a compact interval and…

We are concerned with describing the structure of the set of points in the unit interval which, when subjected to rotation by irrational alpha modulo one, for all finite portions of the orbit contain at least as many points in the bottom…

We consider a family of piecewise contractions admitting a rotation number and defined for every $x\in[0,1)$ by $f(x)=\lambda x + \delta + d \theta_a(x) \pmod 1$, where $\lambda\in(0,1)$, $d\in(0,1-\lambda)$, $\delta\in[0,1]$, $a\in[0,1]$…

We apply set-valued numerical methods to compute an accurate enclosure of the rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points, which is used to check the rationality of the…

In this article we give two different ways of representations of circular words. Representations with tuples are intended as a compact notation, while representations with trees give a way to easily process all conjugates of a word. The…

Let $\theta = [0; a_1, a_2, \dots]$ be the continued fraction expansion of an irrational real number $\theta \in (0, 1)$. It is well-known that the characteristic Sturmian word of slope $\theta$ is the limit of a sequence of finite words…

All elementary Hamiltonians in nature are expected to be invariant under rotation. Despite this restriction, we usually assume that any arbitrary measurement or unitary time evolution can be implemented on a physical system, an assumption…