![]() |
![]() |
![]() Decision problems for profinite groupsAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact David Craven. There is no algorithm to determine if a finitely presented profinite group is non-trivial. I will discuss the proof of this result and some of the consequences. This is joint work with Martin Bridson. This talk is part of the Algebra seminar series. This talk is included in these lists:Note that ex-directory lists are not shown. |
Other listsType the title of a new list here Molecular and Medical Physics Seminar Series Computer Security SeminarsOther talksTBA The tragic destiny of Mileva Marić Einstein Proofs of Turán's theorem Ultrafast Spectroscopy and Microscopy as probes of Energy Materials TBA Life : it’s out there, but what and why ? |