2000 character limit reached
Random Nilpotent Groups of Maximal Step
Published 16 Jan 2022 in math.GR | (2201.06033v1)
Abstract: Let $G$ be a random torsion-free nilpotent group generated by two random words of length $\ell$ in $U_n(\mathbb{Z})$. Letting $\ell$ grow as a function of $n$, we analyze the step of $G$, which is bounded by the step of $U_n(\mathbb{Z})$. We prove a conjecture of Delp, Dymarz, and Schafer-Cohen, that the threshold function for full step is $\ell = n2$.
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.