dc.contributor.author | Currie, James D. | |
dc.date.accessioned | 2018-01-15T19:31:05Z | |
dc.date.available | 2018-01-15T19:31:05Z | |
dc.date.issued | 2016-05-27 | |
dc.identifier.citation | James D. Currie. “A Ternary Square-free Sequence Avoiding Factors Equivalent to abcacba.” Electronic Journal of Combinatorics 23(2) (2016) P2.41,http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p41 | en_US |
dc.identifier.issn | 1077-8926 | |
dc.identifier.uri | http://hdl.handle.net/10680/1342 | |
dc.description.abstract | We solve a problem of Petrova, finalizing the classification of letter patterns avoidable by ternary square-free words; we show that there is a ternary square-free word avoiding letter pattern xyzxzyx. In fact, we characterize all the (two-way) infinite ternary square-free words avoiding letter pattern xyzxzyx characterize the lexicographically least (one-way) infinite ternary square-free word avoiding letter pattern xyzxzyx show that the number of ternary square-free words of length n avoiding letter pattern xyzxzyx grows exponentially with n. | en_US |
dc.description.uri | http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i2p41 | |
dc.language.iso | en | en_US |
dc.publisher | The Electronic Journal of Combinatorics | en_US |
dc.rights | info:eu-repo/semantics/openAccess | |
dc.subject | Squarefree words | en_US |
dc.title | A Ternary Square-free Sequence Avoiding Factors Equivalent to abcacba | en_US |
dc.type | Article | en_US |