Wednesday, June 20, 2012 3:40 pm
-
3:40 pm
EDT (GMT -04:00)
Chris Conidis, Pure Mathematics Department, University of Waterloo
"The Complexity of Ascendant Sequences in Locally Nilpotent Groups - Part II"
We will give a computably enumerable construction of ascendant sequences in locally nilpotent groups via P. Hall's Collection Process for nilpotent groups.