Existence of words over a binary alphabet free from squares with mismatches (Q2332806)

It is well known that any word over a binary alphabet does not contain squares, i.e., factors having the form \(xx\) for some word \(x\). Here it is proved that, for any \(\Delta\), in a binary alphabet there exist arbitrarily long words free from factors of the form \(xy\) where the words \(x\) and \(y\) differ by at most \(\Delta\) letters.