--- title: Epichristoffel Words in Episturmian Combinatorics url: https://www.emergentmind.com/topics/epichristoffel-words type: topic --- # Epichristoffel Words in Episturmian Combinatorics Epichristoffel words are the finite episturmian analogue of Christoffel words. In the recent morphic formulation, an epichristoffel class is a set of words of the form \(\phi(a)\), where \(\phi\) is an episturmian morphism and \(a\) is a letter, and an epichristoffel word is the unique Lyndon word in such a class; its conjugates are called c-epichristoffel words. In the binary case, Christoffel words are exactly the epichristoffel words on a 2-letter alphabet, so the subject extends classical Christoffel/Sturmian combinatorics into the episturmian setting over alphabets of size at least three [2507.15313] [2409.09824]. ## 1. Definitions and formal setting Christoffel words provide the binary model. Over \(A=\{x,y\}\), the Christoffel word of slope \(\frac{a}{b}\) is obtained by encoding the lower Christoffel path from \((0,0)\) to \((b,a)\) by \(x\) for a horizontal step and \(y\) for a vertical step. Equivalently, a finite word \(w\) over \(\{x,y\}\) is a Christoffel word if and only if it is a balanced Lyndon word, that is, balanced and primitive and lexicographically smallest in its conjugacy class [2507.15313]. For a finite alphabet \(A\), the episturmian morphisms used in the epichristoffel setting are generated by the maps \[ V_{a_1}^+(a_1)=a_1,\qquad V_{a_1}^+(a_k)=a_1a_k\quad (a_k\neq a_1), \] \[ V_{a_1}^-(a_1)=a_1,\qquad V_{a_1}^-(a_k)=a_ka_1\quad (a_k\neq a_1), \] together with the swaps \[ \theta_{a_1a_2}(a_1)=a_2,\qquad \theta_{a_1a_2}(a_2)=a_1, \] and \(\theta_{a_1a_2}(a_k)=a_k\) for \(a_k\notin\{a_1,a_2\}\). The monoid generated by all \(V_a^+\), \(V_a^-\), and \(\theta_{ab}\) is the monoid of episturmian morphisms, while the monoid generated only by \(V_a^+\) and \(V_a^-\) is the monoid of pure episturmian morphisms [2507.15313]. An epichristoffel class is then defined as a set of words \(w\in A^*\) for which there exists an episturmian morphism \(\phi\) and a letter \(a\in A\) such that \(w=\phi(a)\). An epichristoffel word is the unique Lyndon word in such a class, and a word is c-epichristoffel if it is conjugate to an epichristoffel word. If \(w\) is epichristoffel over \(A=\{a_0,\dots,a_{k-1}\}\), the vector \[ \mathbf p(w)=\bigl(|w|_{a_0},\dots,|w|_{a_{k-1}}\bigr) \] is its epichristoffel \(k\)-tuple [2507.15313]. ## 2. Episturmian environment and finite-factor placement The natural infinite ambient class is the class of episturmian words. An infinite word \(t\in A^\omega\) is episturmian if its factor set is closed under reversal and it has at most one right special factor of each length; it is standard if all left special factors are prefixes. Standard episturmian words admit a directive word \[ \Delta(s)=x_1x_2x_3\cdots \] and palindromic prefixes defined by \[ u_{n+1}=(u_nx_n)^{(+)}, \] where \((\cdot)^{(+)}\) is palindromic right-closure. A standard episturmian word is strict when every letter of the alphabet appears infinitely often in its directive word, and on a \(k\)-letter alphabet such words have factor complexity \[ p(n)=(k-1)n+1. \] For \(k=2\), strict episturmian words are exactly the aperiodic Sturmian words [0708.4406]. Glen’s characterization of fine words places strict episturmian and strict skew episturmian words in the same lexicographic framework. For an infinite word \(t\) with \(\mathrm{Alph}(t)=A\), \(t\) is fine if and only if either \(t\) is strict episturmian, or \[ t=v\mu(v), \] where \(v\) is a \(B\)-strict standard episturmian word with \(B=A\setminus\{x\}\), \(\mu\) is a pure epistandard morphism on \(B\), and \(v\) is a non-empty suffix of \(\mu(\widetilde v_p x)\) for some \(p\in\mathbb N\). These strict skew episturmian words are non-recurrent, but all their finite factors are finite episturmian words [0708.4406]. This finite-factor layer is the immediate combinatorial habitat of epichristoffel words. The explicit conclusion drawn in the fine-word literature is that finite factors of strict episturmian words are finite episturmian words, and that Epichristoffel words live precisely in this finite episturmian category [0708.4406]. ## 3. Morphic construction and directive data A central existence criterion for epichristoffel words is expressed in terms of the epichristoffel \(k\)-tuple. Paquin’s criterion uses an operator \(T\) on \(\mathbb N^k\) and states that there exists an epichristoffel word with occurrence vector \(\mathbf p\) if and only if some finite iteration of \(T\) applied to \(\mathbf p\) yields a vector with exactly one coordinate equal to \(1\) and all other coordinates equal to \(0\). In the 3-letter example \[ (1,4,2)\xrightarrow{T}(1,1,2)\xrightarrow{T}(1,1,0)\xrightarrow{T}(1,0,0), \] the corresponding morphic construction is \[ V_yV_zV_y(x)=yzyyzyx, \] so \(yzyyzyx\) is c-epichristoffel, and if \(x1\) can be non-uniquely written as a product of two c-epichristoffel words [2507.15313]. The tree construction isolates a subclass where Christoffel-like factorization survives. Starting from a c-epichristoffel word \[ w'=V_{i_1}\cdots V_{i_\ell}(a_j) \] and the factorization induced by the last morphic step, \[ w'=uv, \] one passes to the Lyndon representatives of the conjugacy classes of \(u\) and \(v\), obtaining a root pair \((u',v')\). The children are then defined exactly as in the Christoffel tree: \[ (u',u'v')\qquad\text{and}\qquad(u'v',v'). \] A key lemma proves that if \(w=uv\) is a c-epichristoffel word whose factorization comes from the morphic construction, then \[ uuv\qquad\text{and}\qquad uvv \] are also c-epichristoffel. From this, every word appearing in an epichristoffel tree is shown to be epichristoffel [2507.15313]. The same construction has a tuple version. If \(\mathbf u\) and \(\mathbf v\) are the occurrence vectors of \(u'\) and \(v'\), one defines the vector mediant by \[ \mathbf y\oplus \mathbf z=(y_1+z_1,\dots,y_k+z_k). \] Iterating mediant insertion yields a Stern–Brocot-type tree of \(k\)-tuples associated with the epichristoffel tree. This tuple tree generates infinite families of epichristoffel \(k\)-tuples from a single root. In the ternary case, it is used to prove that for every integer \(n>4\), except \(n=5\), there exists an epichristoffel word over \(\{x,y,z\}\) of length \(n\) in which each letter appears at least once [2507.15313]. The tree also separates two factorization regimes. If the root epichristoffel word cannot be factorized as a product of two epichristoffel words, then the right diagonal \(R_1\) of its epichristoffel tree consists entirely of epichristoffel words that cannot be so factorized. Conversely, if the root can be factorized into two epichristoffel words, then every word in its epichristoffel tree has such a factorization [2507.15313]. ## 5. Binary Christoffel/Sturmian model The binary Christoffel/Sturmian theory remains the reference model for epichristoffel structure. Finite binary balanced words are exactly finite Sturmian words, and a finite Sturmian word is bispecial when it is both left and right special. Central words are characterized by two coprime periods \(p\) and \(q\) with \[ |w|=p+q-2, \] and strictly bispecial Sturmian words are exactly the central words. Primitive Christoffel words are exactly the words \(xwy\) with \(x\neq y\) whose maximal internal factor \(w\) is central [1311.4904]. Fici’s main theorem extends this from primitive Christoffel words to all Christoffel words: \[ BS=\{\,w\mid xwy\text{ is a Christoffel word},\ x,y\in\{a,b\}\,\}. \] Equivalently, bispecial Sturmian words are precisely the maximal internal factors of all Christoffel words. The internal factor \(w\) has the explicit form \[ w=(uyx)^n u, \] where \(u\) is central and \(n\ge 0\); the case \(n=0\) gives the strictly bispecial, palindromic, primitive-Christoffel core, while \(n\ge 1\) yields non-strictly bispecial words and non-primitive Christoffel words [1311.4904]. This binary correspondence also gives exact enumeration. If \(BS(n)\) is the number of bispecial Sturmian words of length \(n\), then \[ BS(n)=2(n+1)-\phi(n+2), \] where \(\phi\) is Euler’s totient. The same Christoffel description identifies minimal forbidden words for the finite Sturmian language as the words \(ywx\) such that \(xwy\) is a non-primitive Christoffel word [1311.4904]. For epichristoffel theory, this binary theorem functions as the structural template. The explicit suggestion made in the Christoffel/Sturmian literature is that a higher-alphabet “epi-bispecial” theory should again relate maximal internal factors to epichristoffel words, in the same way that bispecial Sturmian words are the maximal internal factors of Christoffel words [1311.4904]. ## 6. Palindromic richness and repetition Epichristoffel words inherit their broader palindromic context from episturmian and rich-word theory. A finite word \(w\) is rich when it has exactly \(|w|+1\) distinct palindromic factors, including \(\varepsilon\), and a finite or infinite word is rich if and only if every complete return to every palindromic factor is itself a palindrome. Episturmian words are rich, and recurrent balanced rich infinite words are precisely the balanced episturmian words [0801.1656]. This has two consequences for epichristoffel study. First, it situates finite episturmian words inside the palindromically maximal regime. Second, it makes complete returns and palindromic closure central tools for analyzing finite episturmian objects. The same paper shows that recurrent balanced weakly rich words on at least three letters are necessarily periodic episturmian, and that balanced richness together with distinct letter frequencies drives the system toward Fraenkel-type periodicity [0801.1656]. Repetition theory imposes a complementary constraint. Every infinite rich word contains a square, and all rich square-free words are finite. If \(r(n)\) denotes the length of a longest rich square-free word on an alphabet of size \(n\), then the known exact values for small alphabets are \[ r(1)=1,\ r(2)=3,\ r(3)=7,\ r(4)=15,\ r(5)=33,\ r(6)=67,\ r(7)=145, \] and the general bounds proved are \[ 2.008^n < r(n) < 2.237^n\qquad (n\ge 5). \] Since episturmian words are rich, any infinite episturmian extension of an epichristoffel construction necessarily contains squares. This constrains the possible square-free finite factors in any episturmian or epichristoffel environment [1603.01058]. ## 7. Arithmetic and structural extensions A recent arithmetic approach associates to a Christoffel word \(w\) over \(\{a