Avoiding 2-binomial squares and cubes

M. Rao, M. Rigo, P. Salimov

Two finite words $u,v$ are 2-binomially equivalent if, for all words $x$ of length at most 2, the number of occurrences of $x$ as a (scattered) subword of $u$ is equal to the numbe…