Avoidable words
Combinatorics
2018-01-29 v2
Abstract
The set of all avoidable patterns in n or fewer letters can be avoided on an alphabet with 2(n+2) letters.
Cite
@article{arxiv.1801.07458,
title = {Avoidable words},
author = {Irina Melnichuk},
journal= {arXiv preprint arXiv:1801.07458},
year = {2018}
}
Comments
In Russian. The proof of this theorem was discovered long ago, in this version it was sent to the journal in 1996, but it was not published. I thank D. McNulty, K.Adaricheva for finding me and advising me to publish this result