We will introduce both the classical Hanna Neumann Conjecture and its strengthened version, discuss Stallings' reformulation in terms of immersions of graphs, and look at some partial results. If time allows we shall also look at the new approach of Joel Friedmann.
I'll start with the definition of the first Grigorchuk group as an automorphism group on a binary tree. After that I give a short overview about what growth means, and what kinds of growth we know. On this occasion I will mention a few groups that have each kind of growth and also outline what the 'Gap Problem' was. Having explained this I will prove - or depending on the time sketch - why this Grigorchuk group has intermediate growth. Depending on the time I will maybe also mention one or two open problems concerning growth.
There are two competing notions for a normal subsystem of a (saturated) fusion system. A recent theorem of mine shows how the two notions are related. In this talk I will discuss normal subsystems and their properties, and give some ideas on why this might be useful or interesting.
The first part of Galois' Second Mémoire, less than three pages of manuscript written in 1830, is devoted to an amazing insight, far ahead of its time. Translated into modern mathematical language (and out of French), it is the theorem that a primitive soluble finite permutation group has prime-power degree. This, and Galois' ideas, and counterexamples to some of
them, will be my theme.
This talk will introduce various aspects of modern cryptography. After introducing RSA and some factoring algorithms, I will move on to how elliptic curves can be used to produce a more complex form of Diffie--Hellman key exchange.