The plan is to learn about the basic set-up (concepts, terminology) for studying smooth representations of reductive p-adic groups. We start with six lectures, based on lecture notes . See the programme for more details.
I will report on some recent work on algorithmic randomness in profinite groups. In particular, we will compare the property of "generating an open subgroup in a profinite group" against different notions of algorithmic randomness. This is joint work with Willem Fouche and Andre Nies.
Totally disconnected locally compact groups
Word Growth in Groups
Bass-Serre Theory and Profinite Analogues
p-Adic analytic pro-p groups
Invariant random subgroups
Probabilistic methods in group theory