Searcharxiv⌕ Search

arXiv subjects

Valérie Berthé

Publications and source records attributed to Valérie Berthé.

At least 19 recordsLinked to original sources
arXiv2026

Continuous eigenvalues of minimal subshifts via S-adic representations and coboundaries

We provide characterizations of continuous eigenvalues for minimal symbolic dynamical systems. These characterizations rely on a description of the system in terms of $S$-adic structures (i.e. infinite compositions of morphisms) satisfying natural mild conditions, such as recognizability and primitivity. Under the additional assumptions of finite alphabet rank or decisiveness of the directive sequence, these characterizations involve sequences of letter coboundaries. We emphasize the role of combinatorics in the study of continuous eigenvalues through the interplay between letter coboundaries and extension graphs, and we provide several sets of sufficient conditions ensuring the triviality of letter coboundaries. These results are applied, among other settings, to linear involutions and to the Thue--Morse system in the rational base $3/2$. We also illustrate the versatility of the notion of letter coboundaries in the context of bounded symbolic discrepancy. In particular, we recover a simple characterization of letter balance for primitive substitutive subshifts. Finally, we refine known descriptions of the possible continuous eigenvalues in terms of the measures of the bases of the towers provided by the $S$-adic representation.

math.DS↗
arXiv2026

Preservation Theorems for Transducer Outputs

Suppose we have a deterministic finite-state transducer $A$ and an infinite word $x$, and run $A$ on $x$ to obtain an infinite word $A(x)$. Which properties of $x$ are guaranteed to also hold for $A(x)$? In this paper, we study this preservation question for various well-known combinatorial properties, e.g., recurrence, being morphic, and having factor frequencies. The celebrated Krohn-Rhodes theorem provides the framework for proving our preservation results, and our techniques are based on the ergodic theory of symbolic dynamical systems, i.e., shift spaces.

cs.FL↗
arXiv2026

Density of group languages in shift spaces

The density of a rational language can be understood as the frequency of some pattern in the shift space, for example a pattern like "words with an even number of a given letter." We study the density of group languages, i.e. rational languages recognized by morphisms onto finite groups, inside shift spaces. We show that the density with respect to any given ergodic measure on a shift space exists for every group language, because it can be computed by using any ergodic lift of the given measure to a skew product between the shift space and the recognizing group. We then further study densities in shifts of finite type (with a suitable notion of irreducibility), and then in minimal shifts. In the latter case, we obtain a closed formula for the density under the condition that the aforementioned skew product has minimal closed invariant subsets which are ergodic under the product of the original measure and the uniform probability measure on the group. The formula is derived in part from a characterization of minimal closed invariant subsets for skew products between shifts and finite groups relying on notions of cocycles and coboundaries. In the case where the whole skew product is ergodic under the product measure, then the density is just the cardinality of the subset of the group which defines the language divided by the cardinality of the group. Moreover, we provide sufficient conditions for the skew product to have minimal closed invariant subsets that are ergodic under the product measure. Finally, we investigate the link between minimal closed invariant subsets, return words and bifix codes.

math.DS↗
arXiv2026

On the Decidability of Monadic Theories of Arithmetic Predicates

We investigate the decidability of the monadic second-order (MSO) theory of the structure $\langle \mathbb{N};<,P_1, \ldots,P_d \rangle$, for various unary predicates $P_1,\ldots,P_d \subseteq \mathbb{N}$. We focus in particular on 'arithmetic' predicates arising in the study of linear recurrence sequences, such as fixed-base powers $k^{\mathbf{N}} = \{k^n : n \in \mathbb{N}\}$, $k$-th powers $\mathbf{N}^k = \{n^k : n \in \mathbb{N}\}$, and the set of terms of the Fibonacci sequence $\mathsf{Fib} = \{0,1,2,3,5,8,13,\ldots\}$ (and similarly for other linear recurrence sequences having a single, non-repeated, dominant characteristic root). We obtain several new unconditional and conditional decidability results, a select sample of which are the following: $\bullet$ The MSO theory of $\langle \mathbb{N};<, 2^{\mathbf{N}}, \mathsf{Fib} \rangle$ is decidable; $\bullet$ The MSO theory of $\langle \mathbb{N};<, 2^{\mathbf{N}}, 3^{\mathbf{N}}, 6^{\mathbf{N}} \rangle$ is decidable; $\bullet$ The MSO theory of $\langle \mathbb{N};<, 2^{\mathbf{N}}, 3^{\mathbf{N}}, 5^{\mathbf{N}} \rangle$ is decidable assuming Schanuel's conjecture; $\bullet$ The MSO theory of $\langle \mathbb{N};<, 4^{\mathbf{N}}, \mathbf{N}^2 \rangle$ is decidable; $\bullet$ The MSO theory of $\langle \mathbb{N};<, 2^{\mathbf{N}}, \mathbf{N}^2 \rangle$ is Turing-equivalent to the MSO theory of $\langle \mathbb{N};<,S \rangle$, where $S$ is the predicate corresponding to the binary expansion of $\sqrt{2}$. (As the binary expansion of $\sqrt{2}$ is widely believed to be normal, the corresponding MSO theory is in turn expected to be decidable.) These results are obtained by exploiting and combining techniques from dynamical systems, number theory, and automata theory.

cs.LO↗
arXiv2026

On balance properties of hypercubic billiard words

This paper studies balance properties for billiard words. Billiard words generalize Sturmian words by coding trajectories in hypercubic billiards. In the setting of aperiodic order, they also provide the simplest examples of quasicrystals, as tilings of the line obtained via cut and project sets with a cubical canonical window. By construction, the number of occurrences of each letter in a factor (i.e., a string of consecutive letters) of a hypercubic billiard word only depends on the length of the factor, up to an additive constant. In other words, the difference of the number of occurrences of each letter in factors of the same length is bounded. In contrast with the behaviour of letters, we prove the existence of words that are not balanced in billiard words: the difference of the number of occurrences of such unbalanced factors in longer factors of the same length is unbounded. The proof relies both on topological methods inspired by tiling cohomology and on arithmetic results on bounded remainder sets for toral translations.

math.DS↗
arXiv2026

Nonstationary Markov Partitions and Multidimensional Continued Fraction Algorithms

It is well known from results of Sina\uı and Bowen that a hyperbolic toral automorphism admits a Markov partition. Our aim is to generalize this concept to the nonstationary case, i.e., we associate Markov partitions to nonstationary sequences of toral automorphisms. Special emphasis is placed on sequences of toral automorphisms produced by strongly convergent multidimensional continued fraction algorithms. The convergence of the algorithms is expressed in terms of a Pisot type condition which yields hyperbolicity for the nonstationary dynamics with a splitting into two subspaces of dimension 1 and codimension 1, respectively. For a multidimensional continued fraction map, we first consider its natural extension, whose orbits are given by bi-infinite sequences of matrices with determinant $\pm 1$. The Pisot type condition allows us to interpret an orbit of this natural extension as an Anosov mapping family, i.e., as a bi-infinite sequence of toral automorphisms with well-defined stable and unstable manifolds. We prove that this Anosov mapping family admits a bi-infinite sequence of explicit nonstationary Markov partitions. To obtain the atoms of the Markov partitions, a combinatorial structure, expressed in terms of symbolic dynamical systems, namely substitutive and $\mathcal{S}$-adic shifts, has to be superimposed on the Anosov mapping family. In particular, the atoms of the Markov partitions are geometric realizations of $\mathcal{S}$-adic shifts, defined by suspensions of so-called $\mathcal{S}$-adic Rauzy fractals. These Markov partitions then provide a symbolic model as a nonstationary edge shift for the Anosov mapping family. Restacking of the Markov partition yields a renormalization process that allows us to interpret a multidimensional continued fraction algorithm as a sequence of iteratively induced toral rotations.

math.DS↗
arXiv2025

Meyer sets, Pisot numbers, and self-similarity in symbolic dynamical systems

Aperiodic order refers to the mathematical formalisation of quasicrystals. Substitutions and cut and project sets are among their main actors; they also play a key role in the study of dynamical systems, whether they are symbolic, generated by tilings, or point sets. We focus here on the relations between quasicrystals and self-similarity from an arithmetical and dynamical viewpoint, illustrating how efficiently aperiodic order irrigates various domains of mathematics and theoretical computer science, on a journey from Diophantine approximation to computability theory. In particular, we see how Pisot numbers allow the definition of simple model sets, and how they also intervene for scaling factors for invariance by multiplication of Meyer sets. We focus in particular on the characterisation due to Yves Meyer: any Pisot or Salem number is a parameter of dilation that preserves some Meyer set.

math.DS↗
arXiv2025

The Monadic Theory of Toric Words

For which unary predicates $P_1, \ldots, P_m$ is the MSO theory of the structure $\langle \mathbb{N}; <, P_1, \ldots, P_m \rangle$ decidable? We survey the state of the art, leading us to investigate combinatorial properties of almost-periodic, morphic, and toric words. In doing so, we show that if each $P_i$ can be generated by a toric dynamical system of a certain kind, then the attendant MSO theory is decidable.

cs.LO↗
arXiv2025

Multidimensional statistics for finite orbits of generalised continued fractions

We statistically compare the relationships between frequencies of digits in continued fraction expansions of typical rational points in the unit interval and higher dimensional generalisations. This takes the form of a Large Deviation and Central Limit Theorem, including multidimensional results for random vectors. These results apply to classical multidimensional continued fraction transformations including Brun's algorithm and the Jacobi--Perron algorithm, and more generally for maps satisfying mild contraction hypothesis on the inverse branches. We prove in particular that the finite trajectories capture the generic ergodic behaviour of infinite trajectories.

math.DS↗
arXiv2025

On the rigidity of Arnoux-Rauzy words

An infinite word generated by a substitution is rigid if all the substitutions which fix this word are powers of a same substitution. Sturmian words as well as characteristic Arnoux-Rauzy words are known to be rigid. In the present paper, we prove that all Arnoux-Rauzy words are rigid. The proof relies on two main ingredients: firstly, the fact that the primitive substitutions that fix an Arnoux-Rauzy word share a common power, and secondly, the notion of normal form of an episturmian substitution (i.e., a substitution that fixes an Arnoux-Rauzy word). The main difficulty is then of a combinatorial nature and relies on the normalization process when taking powers of episturmian substitutions: the normal form of a square is not necessarily equal to the square of the normal forms.

cs.DM↗
arXiv2025

Automata on $S$-adic words

A fundamental question in logic and verification is the following: for which unary predicates $P_1, \ldots, P_k$ is the monadic second-order theory of $\langle \mathbb{N}; <, P_1, \ldots, P_k \rangle$ decidable? Equivalently, for which infinite words $α$ can we decide whether a given Büchi automaton $A$ accepts $α$? Carton and Thomas showed decidability in case $α$ is a fixed point of a letter-to-word substitution $σ$, i.e., $σ(α) = α$. However, abundantly more words, e.g., Sturmian words, are characterised by a broader notion of self-similarity that uses a set $S$ of substitutions. A word $α$ is said to be directed by a sequence $s = (σ_n)_{n \in \mathbb{N}}$ over $S$ if there is a sequence of words $(α_n)_{n \in \mathbb{N}}$ such that $α_0 = α$ and $α_n = σ_n(α_{n+1})$ for all $n$; such $α$ is called $S$-adic. We study the automaton acceptance problem for such words and prove, among others, the following. Given finite $S$ and an automaton $A$, we can compute an automaton $B$ that accepts $s \in S^ω$ if and only if $s$ directs a word $α$ accepted by $A$. Thus we can algorithmically answer questions of the form "Which $S$-adic words are accepted by a given automaton $A$?"

cs.FL↗
arXiv2025

Density of rational languages under shift invariant measures

We study density of rational languages under shift invariant probability measures on spaces of two-sided infinite words, which generalizes the classical notion of density studied in formal languages and automata theory. The density for a language is defined as the limit in average (if it exists) of the probability that a word of a given length belongs to the language. We establish the existence of densities for all rational languages under all shift invariant measures. We also give explicit formulas under certain conditions, in particular when the language is aperiodic. Our approach combines tools and ideas from semigroup theory and ergodic theory.

cs.FL↗
arXiv2025

Coboundaries and eigenvalues of finitary S-adic systems

An S-adic system is a symbolic dynamical system generated by iterating an infinite sequence of substitutions or morphisms, called a directive sequence. A finitary S-adic dynamical system is one where the directive sequence consists of morphisms selected from a finite set. We study eigenvalues and coboundaries for finitary recognizable S-adic dynamical systems, i.e., those where points can be uniquely desubstituted using the given sequence of morphisms. To do this we identify the notions of straightness and essential words, and use them to define a coboundary, inspired by of Host's formalism, which allows us to express necessary and sufficient conditions that a complex number must satisfy in order to be a continuous or measurable eigenvalue. We then apply our results to finitary directive sequences of substitutions of constant length, and show how to create constant-length $S$-adic shifts with non-trivial coboundaries. We show that in this case all continuous eigenvalues are rational and we give a complete description of the rationals that can be an eigenvalue, indicating how this leads to a Cobham-style result for these systems.

math.DS↗
arXiv2025

A dynamical view of Tijdeman's solution of the chairman assignment problem

In 1980, R. Tijdeman provided an on-line algorithm that generates sequences over a finite alphabet with minimal discrepancy, that is, such that the occurrence of each letter optimally tracks its frequency. In this article, we define discrete dynamical systems generating these sequences. The dynamical systems are defined as exchanges of polytopal pieces, yielding cut and project schemes, and they code tilings of the line whose sets of vertices form model sets. We prove that these sequences of low discrepancy are natural codings of toral translations with respect to polytopal atoms, and that they generate a minimal and uniquely ergodic subshift with purely discrete spectrum. Finally, we show that the factor complexity of these sequences is of polynomial growth order $n^{d-1}$, where $d$ is the cardinality of the alphabet.

math.DS↗
arXiv2024

Obstructions to return preservation for episturmian morphisms

This paper studies obstructions to preservation of return sets by episturmian morphisms. We show, by way of an explicit construction, that infinitely many obstructions exist. This generalizes and improves an earlier result about Sturmian morphisms.

math.CO↗
arXiv2023

Dynamics of Ostrowski skew-product: I. Limit laws and Hausdorff dimensions

We present a dynamical and spectral study of Ostrowski's map based on the use of transfer operators. The Ostroswki dynamical system is obtained as a skew-product of the Gauss map (it has the Gauss map as a base and interval fibers) and produces expansions of real numbers with respect to an irrational base given by continued fractions. By studying spectral properties of the associated transfer operator, we show that the Ostroswki dynamical system admits an absolutely continuous invariant measure with piecewise holomorphic density and exponential mixing properties. We deduce a central limit theorem for associated random variables of an arithmetic nature and motivated by applications in inhomogeneous Diophantine approximation, we get Bowen--Ruelle type implicit estimates in terms of spectral elements for the Hausdorff dimension of a certain bounded digit set.

math.DS↗
arXiv2022

Lochs-type theorems beyond positive entropy

Lochs' theorem and its generalizations are conversion theorems that relate the number of digits determined in one expansion of a real number as a function of the number of digits given in some other expansion. In its original version, Lochs' theorem related decimal expansions with continued fraction expansions. Such conversion results can also be stated for sequences of interval partitions under suitable assumptions, with results holding almost everywhere, or in measure, involving the entropy. This is the viewpoint we develop here. In order to deal with sequences of partitions beyond positive entropy, this paper introduces the notion of log-balanced sequences of partitions, together with their weight functions. These are sequences of interval partitions such that the logarithms of the measures of their intervals at each depth are roughly the same. We then state Lochs-type theorems which work even in the case of zero entropy, in particular for several important log-balanced sequences of partitions of a number-theoretic nature.

math.NT↗