In this paper, we explore conjugacy languages when the base problem is the generalized conjugacy problem (with constraints): given and , does have a conjugate in (with conjugators in a certain subset)? To do so, for subsets , we define the corresponding languages , , and , following the previously studied cases where . Our results cover several classes of groups: for free groups, we prove that and are regular if and are rational subsets; for hyperbolic groups, we show that if is a regular language of geodesics and is the subsets represented by it, then and are regular; for virtually cyclic groups, we show that is regular if is rational; and, for virtually abelian groups, we prove that belongs to a certain class of languages when the language of words representing elements of also belongs to . We also define relative conjugacy growth and show that its behavior can be heavily dependent on the choice of subset.

生成讲解博客的中文版本

生成AI智能校验的中文版本