Thue characterized completely the avoidability of unary patterns. Adding function variables gives a general setting capturing avoidance of powers, avoidance of patterns with palindromes, avoidance of powers under coding, and other questions of recent interest. Unary patterns with permutations have been previously analysed only for lengths up to 3. Consider a pattern p = π i1 (x). .. π ir (x), with r ≥ 4, x a word variable over an alphabet Σ and π ij function variables, to be replaced by morphic or antimorphic permutations of Σ. If |Σ| ≥ 3, we show the existence of an infinite word avoiding all pattern instances having |x| ≥ 2. If |Σ| = 3 and all π ij are powers of a single morphic or antimorphic π, the length restriction is removed. For the case when π is morphic, the length dependency can be removed also for |Σ| = 4, but not for |Σ| = 5, as the pattern xπ 2 (x)π 56 (x)π 33 (x) becomes unavoidable. Thus, in general, the restriction on x cannot be removed, even for powers of morphic permutations. Moreover, we show that for every positive integer n there exists N and a pattern π i1 (x). .. π in (x) which is unavoidable over all alphabets Σ with at least N letters and π morphic or antimorphic permutation.
We consider a variation on a classical avoidance problem from combinatorics on words that has been introduced by Mousavi and Shallit at DLT 2013. Let pexp i (w) be the supremum of the exponent over the products (concatenation) of i factors of the word w. The repetition threshold RT i (k) is then the infimum of pexp i (w) over all words w ∈ Σ ω k . Mousavi and Shallit obtained that RT i (2) = 2i and RT 2 (3) = 13 4 . We show that RT i (3) = 3i 2 + 1 4 if i is even and RT i (3) = 3i 2 + 1 6 if i is odd and i 3.
This thesis concerns repetitive structures in words. More precisely, it contributes to studying appearance and absence of such repetitions in words. In the first and major part of this thesis, we study avoidability of unary patterns with permutations. The second part of this thesis deals with modeling and solving several avoidability problems as constraint satisfaction problems, using the framework of MiniZinc. Solving avoidability problems like the one mentioned in the past paragraph required, the construction, via a computer program, of a very long word that does not contain any word that matches a given pattern. This gave us the idea of using SAT solvers. Representing the problem-based SAT solvers seemed to be a standardised, and usually very optimised approach to formulate and solve the well-known avoidability problems like avoidability of formulas with reversal and avoidability of patterns in the abelian sense too. The final part is concerned with a variation on a classical avoidance problem from combinatorics on words. Considering the concatenation of i different factors of the word w, pexp_i(w) is the supremum of powers that can be constructed by concatenation of such factors, and RTi(k) is then the infimum of pexp_i(w). Again, by checking infinite ternary words that satisfy some properties, we calculate the value RT_i(3) for even and odd values of i.
No abstract
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.