Conjugacy languages in virtual graph products (Q6052936)

Let \(\Gamma\) be a finite simple graph, where each vertex has a group assigned to it, the graph product associated to \(\Gamma\) is the group \(G_{\Gamma}\) generated by the vertex groups, with the added relations that two elements commute if they lie in distinct vertex groups which are adjacent in the graph. Virtual graph products are groups which contain a finite index subgroup isomorphic to a graph product. The focus of the paper under review is the study of the behavior of conjugacy languages in virtual graph products, so as to extend the results of \textit{L. Ciobanu} et al. [Isr. J. Math. 211, 311--347 (2016; Zbl 1398.20050)]. First, the author studies the behavior of twisted conjugacy representatives in right-angled Artin and Coxeter groups. She proves regularity of the conjugacy geodesic language for virtual graph products in certain cases and highlight properties of the spherical conjugacy language, depending on the automorphism and ordering on the generating set. Finally, she gives a criterion for when the spherical conjugacy language is not unambiguous context-free for virtual graph products.