Sturmian Characteristic Word

• Sturmian characteristic word is an infinite binary sequence defined by an irrational slope and its continued fraction expansion, yielding exactly n+1 distinct factors of length n.
• It is generated by standard morphisms prescribed by a directive sequence, resulting in a fixed point that is balanced and uniformly recurrent.
• The detailed combinatorial decomposition into singular and adjoining words interconnects symbolic dynamics, number theory, and quasicrystal theory for algorithmic analysis.

A Sturmian characteristic word is an infinite binary word $c_\alpha$ associated to an irrational slope $\alpha\in(0,1)$; it arises as the canonical symbolic coding of the minimal aperiodic sequences with factor complexity $n+1$ for each length $n$. The combinatorics, structure, and generation of $c_\alpha$ are governed by the continued fraction expansion of $\alpha$, encoded in a directive sequence that prescribes standard morphisms whose fixed points are precisely the characteristic words. The theory connects word combinatorics, symbolic dynamics, continued fractions, morphic substitutions, and number theory in a unified framework that supports explicit decomposition results, factorization, algorithmic generation, and deep classifications of infinite aperiodic order.

1. Definition, Standard Sequences, and Minimal Complexity

A characteristic Sturmian word $c_\alpha$ over an alphabet $\mathcal{A} = \{a, b\}$ is determined for irrational $\alpha \in (0,1)$ by its continued fraction

$$\alpha = [0; 1 + d_1, d_2, \dots], \quad d_i > 0, \ d_1 \geq 1.$$

Given the directive sequence $\alpha\in(0,1)$0, define the standard sequence recursively: $\alpha\in(0,1)$1 The infinite word

$\alpha\in(0,1)$2

is the characteristic Sturmian word of slope $\alpha\in(0,1)$3. It satisfies

$\alpha\in(0,1)$4

giving the minimal complexity for an aperiodic word. $\alpha\in(0,1)$5 is defined analogously as the characteristic word for slope $\alpha\in(0,1)$6.

These words are balanced (any two factors of equal length differ by at most one in the number of each letter), uniformly recurrent, and serve as the canonical "quasicrystals" in symbolic combinatorics (0708.4387).

2. Generation via Morphisms and Fixed Point Structure

Sturmian characteristic words are generated by "standard" morphisms built from the directive sequence. Consider the morphism $\alpha\in(0,1)$7 associated with the continued fraction expansion as in (0708.4387):

• The standard morphism $\alpha\in(0,1)$8 is defined so that for all $\alpha\in(0,1)$9, $n+1$0.
• The letter exchange $n+1$1 (involution $n+1$2) defines $n+1$3.

Fixed point property: $n+1$4 is a fixed point of any power of the standard morphism: $n+1$5 if and only if $n+1$6 with $n+1$7.

Thus, the morphic generation process is entirely determined by the continued fraction of $n+1$8, and the standard sequence reflects the combinatorial structure of $n+1$9 mirrored in the inflation structure of $n$0 (0708.4387).

3. Conjugates, Singular Decomposition, and Structure

Conjugation extends classically: for infinite $n$1 and $n$2, the $n$3-th conjugate is the infinite word with prefix of length $n$4 removed. The central result of (0708.4387) is that every conjugate of $n$5 admits a decomposition into "generalized adjoining singular words" (Melançon's singular word decomposition).

For $n$6, $n$7, where $n$8 are denominators of convergents of $n$9, the $c_\alpha$0-th conjugate

$c_\alpha$1

admits a decomposition

$c_\alpha$2

where $c_\alpha$3 are (generalized) adjoining singular words determined from the standard sequence $c_\alpha$4 and $c_\alpha$5 is a prefix of a word $c_\alpha$6 also expressible via $c_\alpha$7, $c_\alpha$8. This generalizes decompositions previously available for the Fibonacci word ($c_\alpha$9).

The original singular word decomposition of $\alpha$0 takes the form

$\alpha$1

with singular $\alpha$2 and adjoining singular $\alpha$3 built in terms of $\alpha$4 (0708.4387).

4. Continued Fraction Expansion and Recurrence Structure

The continued fraction expansion is fundamental:

• The directive sequence $\alpha$5 both determines the standard sequence, and prescribes the combinatorial inflation for $\alpha$6 via $\alpha$7.
• The lengths of $\alpha$8 obey $\alpha$9, where $c_\alpha$0 is the denominator of the $c_\alpha$1-th convergent to $c_\alpha$2: $c_\alpha$3
• The decomposition formulae for conjugates of $c_\alpha$4 involve arithmetic relationships directly in terms of $c_\alpha$5 and the partial quotients $c_\alpha$6.

Thus, continued fraction expansions of slopes are not just auxiliary number-theoretic data—they impose the full combinatorial "directive order" on $c_\alpha$7 and its conjugates (0708.4387).

5. Explicit Example: the Case $c_\alpha$8

When $c_\alpha$9 (e.g., $\mathcal{A} = \{a, b\}$0), (0708.4387) gives the complete singular decomposition for every conjugate:

• The standard morphism $\mathcal{A} = \{a, b\}$1 has $\mathcal{A} = \{a, b\}$2 for every $\mathcal{A} = \{a, b\}$3.
• For each $\mathcal{A} = \{a, b\}$4, there exists a word $\mathcal{A} = \{a, b\}$5 of length $\mathcal{A} = \{a, b\}$6 involved in the singular decomposition of conjugates.
• For $\mathcal{A} = \{a, b\}$7 (with $\mathcal{A} = \{a, b\}$8), one has

$\mathcal{A} = \{a, b\}$9

where $\alpha \in (0,1)$0 is a prefix of $\alpha \in (0,1)$1, and the decomposition is fully explicit in terms of the standard sequence and continued fraction data.

This generalizes the earlier results for the infinite Fibonacci word and highlights the explicit influence of partial quotients and convergents on the combinatorics of conjugate decompositions (0708.4387).

6. Applications and Broader Context

The decompositions and structure furnished for characteristic Sturmian words generated by morphisms have several important ramifications:

• In symbolic dynamics and combinatorics on words, these decompositions are essential for analyzing recurrence, palindromic factors, and fine balance properties within minimal complexity infinite words.
• In number theory, the link between continued fractions and Sturmian word generation produces a direct bridge to Diophantine approximation and cutting-sequence algorithms.
• In theoretical computer science, especially pattern recognition and formal languages, singular and adjoining singular word factorizations support efficient string matching and the analysis of self-similarity in aperiodic sequences.
• In quasicrystal theory and aperiodic physical models, the self-similarity and hierarchical structure elucidated by morphic decompositions model hierarchical order and tiling properties.

The explicit decomposition results—where each conjugate can be built from generalized adjoining singular words whose structure is tightly controlled by the continued fraction coefficients—equip practitioners with robust combinatorial and algorithmic tools for dissecting and analyzing Sturmian characteristic words in a variety of mathematical and applied settings (0708.4387).