Avoiding conjugacy classes on the 5-letter alphabet

We construct an infinite word w over the 5-letter alphabet such that for every factor f of w of length at least two, there exists a cyclic permutation of f that is not a factor of w. In other words, w does not contain a non-trivial conjugacy class. This proves the conjecture in Gamard et al. [TCS 2018

Minimal Forbidden Factors of Circular Words

Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al. [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language $M$, computes a DFA recognizing the language whose set of minimal forbidden factors is $M$. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We generalize this result to the case of a circular word. We discuss several combinatorial properties of the minimal forbidden factors of a circular word. As a byproduct, we obtain a formal definition of the factor automaton of a circular word. Finally, we investigate the case of minimal forbidden factors of the circular Fibonacci words.Comment: To appear in Theoretical Computer Scienc

Hyperbolically embedded subgroups and rotating families in groups acting on hyperbolic spaces

We introduce and study the notions of hyperbolically embedded and very rotating families of subgroups. The former notion can be thought of as a generalization of the peripheral structure of a relatively hyperbolic group, while the later one provides a natural framework for developing a geometric version of small cancellation theory. Examples of such families naturally occur in groups acting on hyperbolic spaces including hyperbolic and relatively hyperbolic groups, mapping class groups, $Out(F_n)$, and the Cremona group. Other examples can be found among groups acting geometrically on $CAT(0)$ spaces, fundamental groups of graphs of groups, etc. We obtain a number of general results about rotating families and hyperbolically embedded subgroups; although our technique applies to a wide class of groups, it is capable of producing new results even for well-studied particular classes. For instance, we solve two open problems about mapping class groups, and obtain some results which are new even for relatively hyperbolic groups.Comment: Revision, corrections and improvement of the expositio