• Corpus ID: 246015916

Random Nilpotent Groups of Maximal Step

  title={Random Nilpotent Groups of Maximal Step},
  author={Phillip Harris},
Let G be a random torsion-free nilpotent group generated by two random words of length l in Un(Z). Letting l grow as a function of n, we analyze the step of G, which is bounded by the step of Un(Z). We prove a conjecture of Delp, Dymarz, and Schafer-Cohen, that the threshold function for full step is l = n. A group G is nilpotent if its lower central series G = G0 ≥ G1 ≥ · · · ≥ Gr = {0} defined byGi+1 = [G,Gi], eventually terminates. The first index r for whichGr = 0 is called the step of G… 



A matrix model for random nilpotent groups

We study random torsion-free nilpotent groups generated by a pair of random words of length $\ell$ in the standard generating set of $U_n(\mathbb{Z})$. Specifically, we give asymptotic results about

Invitation to random groups. Ensaios Matemáticos [Mathematical Surveys

  • Sociedade Brasileira de Matemática, Rio de Janeiro
  • 2005

Random nilpotent groups I

We study random nilpotent groups in the well-established style of random groups, by choosing relators uniformly among freely reduced words of (nearly) equal length and letting the length tend to

The Edmonton notes on nilpotent groups

  • Queen Mary College Mathematics Notes,
  • 1969

Invitation to random groups. Ensaios Matemáticos [Mathematical Surveys], Sociedade Brasileira de Matemática

  • 2005

Lectures on nilpotent groups

  • Regional Conference Series in Mathematics American Mathematical Society,
  • 1971