5 citations · 6 across the 6 of their papers we have counts for
6 papers
On a probabilistic extension of the Oldenburger-Kolakoski sequence
Chloé Boisson, Damien Jamet, Irène Marcovici
The Oldenburger-Kolakoski sequence is the only infinite sequence over the alphabet that starts with and is its own run-length encoding. In the present work, we take a…
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences
Damien Jamet, Pierre Popoli, Thomas Stoll
Automatic sequences are not suitable sequences for cryptographic applications since both their subword complexity and their expansion complexity are small, and their correlation me…
Critical connectedness of thin arithmetical discrete planes
Valérie Berthé, Damien Jamet, Timo Jolivet +1
An arithmetical discrete plane is said to have critical connecting thickness if its thickness is equal to the infimum of the set of values that preserve its -connectedness. This…
The number of binary rotation words
Anna E. Frid, Damien Jamet
We consider binary rotation words generated by partitions of the unit circle to two intervals and give a precise formula for the number of such words of length n. We also give the…
On the Number of Balanced Words of Given Length and Height over a Two-Letter Alphabet
Nicolas Bedaride, Eric Domenjoud, Damien Jamet +1
We exhibit a recurrence on the number of discrete line segments joining two integer points in the plane using an encoding of such segments as balanced words of given length and hei…
On the fixed point of the iterated pseudopalindromic closure
D. Jamet, G. Paquin, G. Richomme +1
First introduced in the study of the Sturmian words, the iterated palindromic closure was recently generalized to pseudopalindromes. This operator allows one to construct words wit…