2000 character limit reached
Conjugacy in a family of free-by-cyclic groups
Published 2 Jun 2025 in math.GR | (2506.01248v1)
Abstract: We analyse the geometry and complexity of the conjugacy problem in a family of free-by-cyclic groups $H_m=F_m\rtimes\mathbb{Z}$ where the defining free-group automorphism is positive and polynomially growing. We prove that the conjugator length function of $H_m$ is linear, and describe polynomial-time solutions to the conjugacy problem and conjugacy search problem in $H_m$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.