Conjugacy languages and conjugacy growth relative to subsets of groups
Abstract
In this paper, we explore conjugacy languages when the base problem is the generalized conjugacy problem (with constraints): given g∈ G and U⊂ G, does g have a conjugate in U (with conjugators in a certain subset)? To do so, for subsets U,V⊂eq G, we define the corresponding languages ConjGeo(U,V), CycGeo(U), ConjSL(U) and ConjMinLenSL(U,V), following the previously studied cases where U=V=G. Our results cover several classes of groups: for free groups, we prove that ConjGeo(U,V) and ConjMinLenSL(U,V) are regular if U and V are rational subsets; for hyperbolic groups, we show that if L is a regular language of geodesics and U is the subsets represented by it, then ConjGeo(U) and ConjMinLenSL(U) are regular; for virtually cyclic groups, we show that ConjSL(U) is regular if U is rational; and, for virtually abelian groups, we prove that ConjGeo(U) belongs to a certain class of languages when the language of words representing elements of U also belongs to . We also define relative conjugacy growth and show that its behavior can be heavily dependent on the choice of subset.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.