square-free sequence
A square-free sequence is a sequence which has no adjacent repeating subsequences of any length.
The name “square-free” comes from notation: Let be a sequence. Then is also a sequence, which we write “compactly” as . In the rest of this entry we use a compact notation, lacking commas or braces. This notation is commonly used when dealing with sequences in the capacity of strings. Hence we can write .
Some examples:
- •
, not a square-free sequence.
- •
cannot have any subsequence written in square notation, hence it is a square-free sequence.
- •
, not a square-free sequence.
Note that, while notationally similar to the number-theoretic sense of “square-free,” the two concepts are distinct. For example, for integers and the product , a square. But as a sequence, ; clearly lacking any commutativity that might allow us to shift elements. Hence, the sequence is square-free.