277 research outputs found
Distributing Labels on Infinite Trees
Sturmian words are infinite binary words with many equivalent definitions:
They have a minimal factor complexity among all aperiodic sequences; they are
balanced sequences (the labels 0 and 1 are as evenly distributed as possible)
and they can be constructed using a mechanical definition. All this properties
make them good candidates for being extremal points in scheduling problems over
two processors. In this paper, we consider the problem of generalizing Sturmian
words to trees. The problem is to evenly distribute labels 0 and 1 over
infinite trees. We show that (strongly) balanced trees exist and can also be
constructed using a mechanical process as long as the tree is irrational. Such
trees also have a minimal factor complexity. Therefore they bring the hope that
extremal scheduling properties of Sturmian words can be extended to such trees,
as least partially. Such possible extensions are illustrated by one such
example.Comment: 30 pages, use pgf/tik
The sequence of open and closed prefixes of a Sturmian word
A finite word is closed if it contains a factor that occurs both as a prefix
and as a suffix but does not have internal occurrences, otherwise it is open.
We are interested in the {\it oc-sequence} of a word, which is the binary
sequence whose -th element is if the prefix of length of the word is
open, or if it is closed. We exhibit results showing that this sequence is
deeply related to the combinatorial and periodic structure of a word. In the
case of Sturmian words, we show that these are uniquely determined (up to
renaming letters) by their oc-sequence. Moreover, we prove that the class of
finite Sturmian words is a maximal element with this property in the class of
binary factorial languages. We then discuss several aspects of Sturmian words
that can be expressed through this sequence. Finally, we provide a linear-time
algorithm that computes the oc-sequence of a finite word, and a linear-time
algorithm that reconstructs a finite Sturmian word from its oc-sequence.Comment: Published in Advances in Applied Mathematics. Journal version of
arXiv:1306.225
Inverse problems of symbolic dynamics
This paper reviews some results regarding symbolic dynamics, correspondence
between languages of dynamical systems and combinatorics. Sturmian sequences
provide a pattern for investigation of one-dimensional systems, in particular
interval exchange transformation. Rauzy graphs language can express many
important combinatorial and some dynamical properties. In this case
combinatorial properties are considered as being generated by substitutional
system, and dynamical properties are considered as criteria of superword being
generated by interval exchange transformation. As a consequence, one can get a
morphic word appearing in interval exchange transformation such that
frequencies of letters are algebraic numbers of an arbitrary degree.
Concerning multydimensional systems, our main result is the following. Let
P(n) be a polynomial, having an irrational coefficient of the highest degree. A
word (w=(w_n), n\in \nit) consists of a sequence of first binary numbers
of i.e. . Denote the number of different subwords
of of length by .
\medskip {\bf Theorem.} {\it There exists a polynomial , depending only
on the power of the polynomial , such that for sufficiently
great .
Nested quasicrystalline discretisations of the line
One-dimensional cut-and-project point sets obtained from the square lattice
in the plane are considered from a unifying point of view and in the
perspective of aperiodic wavelet constructions. We successively examine their
geometrical aspects, combinatorial properties from the point of view of the
theory of languages, and self-similarity with algebraic scaling factor
. We explain the relation of the cut-and-project sets to non-standard
numeration systems based on . We finally examine the substitutivity, a
weakened version of substitution invariance, which provides us with an
algorithm for symbolic generation of cut-and-project sequences
- …