Since the symmetric group is a finite group it’s representation theory is not too complex, however in this special case we can realise these representations in a particular nice combinatorial way using young tableaux and young symmetrizers. I will introduce these ideas and use them to describe the representation theory of Sn over the complex numbers.

in this talk I will try to introduce some key ideas and concepts about random walks on discrete spaces, with special interest on random walks on Cayley graphs.

This will be a little potpourri containing some of the recent developments on the model theory of F_p((t)) and of algebraic extensions of Q_p.

The computation of multidimensional persistent homology is one of the major open problems in topological data analysis. 

One can define r-dimensional persistent homology to be a functor from the poset category N^r, where N is the poset of natural numbers, to the category of modules over a commutative ring with identity. While 1-dimensional persistent homology is theoretically well-understood and has been successfully applied to many real-world problems, the theory of r-dimensional persistent homology is much harder, as it amounts to understanding representations of quivers of wild type. 

In this talk I will introduce persistent homology, give some motivation for how it is related to the study of data, and present recent results related to the classification of multidimensional persistent homology.