5 citations · 6 across the 6 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2023
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…
cs.DM2013
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…