14 citations · 27 across the 5 of their papers we have counts for
6 papers
-adic characterization of minimal ternary dendric shifts
France Gheeraert, Marie Lejeune, Julien Leroy
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 s…
Counting the number of non-zero coefficients in rows of generalized Pascal triangles
Julien Leroy, Michel Rigo, Manon Stipulanti
This paper is about counting the number of distinct (scattered) subwords occurring in a given word. More precisely, we consider the generalization of the Pascal triangle to binomia…
Behavior of digital sequences through exotic numeration systems
Julien Leroy, Michel Rigo, Manon Stipulanti
Many digital functions studied in the literature, e.g., the summatory function of the base- sum-of-digits function, have a behavior showing some periodic fluctuation. Such funct…
Generalized Pascal triangle for binomial coefficients of words
Julien Leroy, Michel Rigo, Manon Stipulanti
We introduce a generalization of Pascal triangle based on binomial coefficients of finite words. These coefficients count the number of times a word appears as a subsequence of ano…
-adic conjecture and Bratteli diagrams
Fabien Durand, Julien Leroy
In this note we apply a substantial improvement of a result of S. Ferenczi on -adic subshifts to give Bratteli-Vershik representations of these subshifts.
Towards a statement of the S-adic conjecture through examples
Fabien Durand, Julien Leroy, Gwénaël Richomme
The -adic conjecture claims that there exists a condition such that a sequence has a sub-linear complexity if and only if it is an -adic sequence satisfying Condition …