2 papers
math.CO2025
There exist infinite cube-free words over any sequence of binary alphabets
Vuong Bui, Matthieu Rosenfeld
We prove that for any sequence of binary alphabets , there exists a cube-free word so that $c_1\in\mathcal{A}_1,c_2\in\mathcal{A}_2…
math.CO2025
An explicit condition for boundedly supermultiplicative subshifts
Vuong Bui, Matthieu Rosenfeld
We study some properties of the growth rate of , that is, the language of words over the alphabet avoiding the set of forbidden…