Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Random Nilpotent Groups of Maximal Step (2201.06033v1)

Published 16 Jan 2022 in math.GR

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$.

Summary

We haven't generated a summary for this paper yet.