A family of formulas with reversal of arbitrarily high avoidability index
نویسندگان
چکیده
We present a family of avoidable formulas with reversal whose avoidability index is unbounded. also complete the determination in 3-avoidance basis.
منابع مشابه
Avoidability Index for Binary Patterns with Reversal
For every pattern p over the alphabet {x, y, x, y}, we specify the least k such that p is k-avoidable.
متن کاملAvoidability of circular formulas
Clark has defined the notion of n-avoidance basis which contains the avoidable formulas with at most n variables that are closest to be unavoidable in some sense. The family Ci of circular formulas is such that C1 = AA, C2 = ABA.BAB, C3 = ABCA.BCAB.CABC and so on. For every i 6 n, the n-avoidance basis contains Ci. Clark showed that the avoidability index of every circular formula and of every ...
متن کاملAvoidability of Formulas with Two Variables
In combinatorics on words, a word w over an alphabet Σ is said to avoid a pattern p over an alphabet ∆ of variables if there is no factor f of w such that f = h(p) where h : ∆∗ → Σ∗ 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. We consider the patterns such that at most two variables appear at least twic...
متن کاملA new family of four-step fifteenth-order root-finding methods with high efficiency index
In this paper a new family of fifteenth-order methods with high efficiency index is presented. This family include four evaluations of the function and one evaluation of its first derivative per iteration. Therefore, this family of methods has the efficiency index which equals 1.71877. In order to show the applicability and validity of the class, some numerical examples are discussed.
متن کاملMinimal Spheres of Arbitrarily High Morse Index
We construct a smooth Riemannian metric on any 3-manifold with the property that there are genus zero embedded minimal surfaces of arbitrarily high Morse index.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2021
ISSN: ['1879-2294', '0304-3975']
DOI: https://doi.org/10.1016/j.tcs.2021.10.013