🤖 AI Summary
This study investigates the computational complexity and formal language-theoretic properties of the language of shortest representatives of conjugacy classes in free inverse monoids. It extends the notion of conjugacy languages to this algebraic setting by introducing a new equivalence relation, UConj, which distinguishes between trivial and nontrivial conjugacy classes. Employing techniques from formal language theory, automata theory, and combinatorial group theory, the authors prove that for rank at least two, this language is neither context-free nor co-context-free, whereas in the one-generator case it is context-free. Furthermore, they provide an explicit context-free grammar for the geodesic language of trivial conjugacy classes. These results are subsequently generalized to hyperbolic groups, right-angled Artin groups, and virtually abelian groups.
📝 Abstract
We initiate the study of conjugacy languages in free inverse monoids. Motivated by the notion of conjugacy languages in groups and the study of conjugacy in semigroups, we introduce the language of shortest representatives of conjugacy classes and study it for free inverse monoids of rank at least $2$ under the natural notion of conjugacy. We show that, contrary to the free group case, where this language is regular, in a free inverse monoid it is neither context-free nor co-context-free. In the monogenic case, this language is context-free.
We show that this non-context-freeness comes from elements with nontrivial conjugacy classes. We define an equivalence relation as follows: all elements with a nontrivial conjugacy class are related and elements with trivial conjugacy class are only related to themselves. We call this relation $\mathrm{UConj}$. We show that the language consisting of geodesics representing elements whose conjugacy class is trivial is context-free by providing an explicit context-free grammar generating it.
For groups, we show that the language of minimal representatives of $\mathrm{UConj}$ classes is regular if the group is hyperbolic and for right-angled Artin groups with the standard generating set, it is piecewise testable. For virtually abelian groups, we show that there is a generating set for which this language is piecewise excluding and exhibit an example of a virtually abelian group admitting a generating set for which this language is not regular.