Abstract | ||
---|---|---|
In combinatorics on words, a word w over an alphabet Sigma is said to avoid a pattern p over an alphabet Delta if there is no factor f of w such that f = h(p) where h : A* -> Sigma* is a non -erasing morphism. A pattern p is said to be k -avoidable if there exists an infinite word over a k -letter alphabet that avoids p. A pattern is said to be doubled if no variable occurs only once. Doubled patterns with at most 3 variables and doubled patterns with at least 6 variables are 3 -avoidable. We show that doubled patterns with 4 and 5 variables are also 3 -avoidable. |
Year | Venue | Keywords |
---|---|---|
2016 | ELECTRONIC JOURNAL OF COMBINATORICS | Word,Pattern avoidance |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Existential quantification,Mathematics,Morphism,Combinatorics on words,Alphabet | Journal | 23.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
---|---|---|---|
Pascal Ochem | 1 | 258 | 36.91 |