Existence of words over a binary alphabet free from squares with mismatches (Q2332806): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 07:45, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Existence of words over a binary alphabet free from squares with mismatches |
scientific article |
Statements
Existence of words over a binary alphabet free from squares with mismatches (English)
0 references
5 November 2019
0 references
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.
0 references
Thue sequence
0 references
square-free words
0 references
word combinatorics
0 references
mismatches
0 references