2000 character limit reached
Linear Diophantine equations and conjugator length in 2-step nilpotent groups
Published 2 Jun 2025 in math.GR | (2506.01239v1)
Abstract: We establish upper bounds on the lengths of minimal conjugators in 2-step nilpotent groups. These bounds exploit the existence of small integral solutions to systems of linear Diophantine equations. We prove that in some cases these bounds are sharp. This enables us to construct a family of finitely generated 2-step nilpotent groups $(G_m)_{m\in\mathbb{N}}$ such that the conjugator length function of $G_m$ grows like a polynomial of degree $m+1$.
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.