Lengths of Irreducible and Delicate Words
Benjamin Przybocki
Source abstract
We study words that barely avoid repetitions, for several senses of "barely". A squarefree (respectively, overlap-free, cubefree) word is irreducible if removing any one of its interior letters creates a square (respectively, overlap, cube). A squarefree (respectively, overlap-free, cubefree) word is delicate if changing any one of its letters creates a square (respectively, overlap, cube). We classify the lengths of irreducible and delicate squarefree, overlap-free, and cubefree words over binary and ternary alphabets.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.