arXiv subjects

France Gheeraert

Publications and source records attributed to France Gheeraert.

7 recordsLinked to original sources

arXiv2026

String attractors and bi-infinite words

String attractors are a combinatorial tool coming from the field of data compression. It is a set of positions within a word which captures an occurrence of every factor. While one-sided infinite words admitting a finite string attractor are eventually periodic, the situation is different for two-sided infinite words. In this article, we characterise the bi-infinite words admitting a finite string attractor as the characteristic Sturmian words and their morphic images. For words that do not admit finite string attractors, we study the structure and properties of their infinite string attractors.

math.CO↗

arXiv2025

$\mathcal{S}$-adic characterization of minimal dendric shifts

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange transformations. It is known that any minimal dendric shift has a primitive $\mathcal{S}$-adic representation where the morphisms in $\mathcal{S}$ are positive tame automorphisms of the free group generated by the alphabet. In this paper we give an $\mathcal{S}$-adic characterization of this family by means of two finite graphs. As an application, we are able to decide whether a shift space generated by a uniformly recurrent morphic word is (eventually) dendric.

math.DS↗

arXiv2024

Stability properties for subgroups generated by return words

Return words are a classical tool for studying shift spaces with low factor complexity. In recent years, their projection inside groups have attracted some attention, for instance in the context of dendric shift spaces, of generation of pseudorandom numbers (through the welldoc property), and of profinite invariants of shift spaces. Aiming at unifying disparate works, we introduce a notion of stability for subgroups generated by return words. Within this framework, we revisit several existing results and generalize some of them. We also study general aspects of stability, such as decidability or closure under certain operations.

cs.DM↗

arXiv2024

Algebraic characterization of dendricity

Dendric shift spaces simultaneously generalize codings of regular interval exchanges and episturmian shift spaces, themselves both generalizations of Sturmian words. One of the key properties enforced by dendricity is the Return Theorem. In this paper, we prove its converse, providing the following natural algebraic perspective on dendricity: A minimal shift space is dendric if and only if every set of return words is a basis of the free group over the alphabet.

cs.DM↗

arXiv2024

String attractors of some simple-Parry automatic sequences

Firstly studied by Kempa and Prezza in 2018 as the cement of text compression algorithms, string attractors have become a compelling object of theoretical research within the community of combinatorics on words. In this context, they have been studied for several families of finite and infinite words. In this paper, we obtain string attractors of prefixes of particular infinite words generalizing k-bonacci words (including the famous Fibonacci word) and related to simple Parry numbers. In fact, our description involves the numeration systems classically derived from the considered morphisms. This extends our previous work published in the international conference WORDS 2023.

math.CO↗

arXiv2023

Some properties of morphic images of (eventually) dendric words

The class of (eventually) dendric words generalizes well-known families such as the Arnoux-Rauzy words or the codings of interval exchanges. There are still many open questions about the link between dendricity and morphisms. In this paper, we focus on two questions. The first one is the evolution of the factor complexity when applying a non-erasing morphism to an eventually dendric word. We next look at the morphisms that preserve dendricity for all dendric words and show that they are exactly those generated by the Arnoux-Rauzy morphisms.

cs.DM↗

arXiv2021

$\mathcal{S}$-adic characterization of minimal ternary dendric shifts

Dendric shifts are defined by combinatorial restrictions of the extensions of the words in their languages. This family generalizes well-known families of shifts such as Sturmian shifts, Arnoux-Rauzy shifts and codings of interval exchange transformations. It is known that any minimal dendric shift has a primitive $\mathcal{S}$-adic representation where the morphisms in $\mathcal{S}$ are positive tame automorphisms of the free group generated by the alphabet. In this paper we investigate those $\mathcal{S}$-adic representations, heading towards an $\mathcal{S}$-adic characterization of this family. We obtain such a characterization in the ternary case, involving a directed graph with 2 vertices.

math.DS↗