56 citations · 118 across the 18 of their papers we have counts for
5 papers · 1 filter
A Set of Sequences of Complexity
Julien Cassaigne, Sébastien Labbé, Julien Leroy
We prove the existence of a ternary sequence of factor complexity for any given vector of rationally independent letter frequencies. Such sequences are constructed from an i…
Counting Subwords Occurrences in Base-b Expansions
Julien Leroy, Michel Rigo, Manon Stipulanti
We count the number of distinct (scattered) subwords occurring in the base-b expansion of the non-negative integers. More precisely, we consider the sequence co…
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…