Disposability in Square-Free Words
Abstract
We consider words w over the alphabet =\0,1,2\. It is shown that there are irreducibly square-free words of all lengths n except 4,5,7 and 12. Such a word is square-free (i.e., it has no repetitions uu as factors), but by removing any one internal letter creates a square in the word.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.