Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Sturmian sequences"”.

  1. A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence

    We investigate a class of minimal sequences on a finite alphabet Ak = {1,2,...,k} having (k - 1)n + 1 distinct subwords of length n. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of binary Sturmian sequences. We describe two simple combinatorial …

    unt Repository record for A Generalization of Sturmian Sequences: Combinatorial Structure and Transcendence (opens in a new tab)

  2. Beatty ratios, algorithms related to Sturmian sequences and uniform distribution theory

    … study properties of ratios of elements of Beatty sequences and their connection with Sturmian sequences. If we write $a_n=\lfloor n a \rfloor$ for $a$ a real number and $n \in \N$, then we are concerned with ratios of the form $$r_{a}(n,k):=\frac{ a_{n+k}}{a_n} $$ \noindent as well as their …

    uiuc Repository record for Beatty ratios, algorithms related to Sturmian sequences and uniform distribution theory (opens in a new tab)

  3. Some Results in Maximal Pattern Complexity

    … aperiodic sequence 𝑥 over two letters as pattern Sturmian if it had the lowest possible maximal pattern complexity, 2𝑛. Later, Kamae and Rao extended their definition of pattern Sturmian sequences to be sequences over ℓ ≥ 2 letters which are not periodic by projection and have maximal pattern …

    denver Repository record for Some Results in Maximal Pattern Complexity (opens in a new tab)

  4. Automatic sequences from algebraic, dynamical, and computational perspectives

    … some interesting properties of automatic sequences and other relative families of sequences using three broadly distinguished approaches: algebraic, dynamical, and computational. We consider the semigroup associated to a primitive substitution. We use it to construct a minimal automaton …

    the-open-u Download PDF for Automatic sequences from algebraic, dynamical, and computational perspectives (opens in a new tab)

  5. A minimal subsystem of the Kari-Culik tilings

    … namely those whose rows can be interpreted as Sturmian sequences (rotation sequences), is minimal with respect to the Z^2 action of translation. We give a characterization of this space as a skew product as well as explicit bounds on the waiting time between occurrences of m × n configurations.

    uvic Repository record for A minimal subsystem of the Kari-Culik tilings (opens in a new tab)

  6. Ham sandwiches, staircases and counting polynomials

    … points is closely related to the Beatty and Sturmian sequences of rational numbers defined in number theory. We present three characterizations of these sequences from a geometric point of view. One of these characterizations is known, two are new. The most important one is recursive and …

    fu-berlin Repository record for Ham sandwiches, staircases and counting polynomials (opens in a new tab)