Showing 2015Show all
2 papers · 1 filter
math.LO2015
Describing Groups
Meng-Che Ho
We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the compl…
math.GR2015
Random nilpotent groups I
Matthew Cordes, Moon Duchin, Yen Duong +2
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…