Prof. Dr. Moritz Weber
Dr. Tobias Mai
Research seminar Free Probability Theory
Oberseminar zur Freien Wahrscheinlichkeitstheorie
In this research seminar we treat topics ranging from free probability and random matrix theory to combinatorics, operator algebras, functional analysis and quantum groups.

Time and place
Wednesdays, 16:1518:00, room SR 6, building E2 4
talks are 60 minutes plus discussion
Due to the current circumstances, all talks will be given online using the platform Zoom.
Talks in 2020
 27.05.2020, 2:15pm, Nina Becker (Saarland University)
Zur Asymptotik der Maxima von Faberpolynomen bei wachsendem Grad
 24.06.2020, 4:15pm, Friedrich Günther (Saarland University)
Easy groups as matrix groups
Easy groups as defined by Banica and Speicher and Unitary easy groups as defined by Weber and Tarrago are special compact matrix groups that sit between S_{n} and O_{n} respectively S_{n} and U_{n}. While recovered via abstract Tannaka Krein duality, a verification of the given groups is possible using basic representational methods and elementary matrix calculations, as will be shown in the talk.
 22.07.2020, 4:15pm, Alexander Wendel (Saarland University)
Hochschild cohomology of free easy quantum groups
In this talk a method for calculating the second Hochschild cohomlogy groups of quantum subgroups of the unitary quantum group due to Franz and coworkers will be presented. This method had already been used to calculate the second cohomlogy groups of some free easy quantum groups. The remaining cases as well as the general method will be presented.
 16.09.2020, 4:15pm, Jonas Wahl (Hausdorff Center for Mathematics, Bonn)
A probabilistic approach to diagram algebras
I will present recent results on the representation theory of infinite diagram algebras that appear in the theory of partition quantum groups. We will discuss the branching graphs of these algebras and show how traces on them can be classified by understanding them as random processes on wellstudied combinatorial structures such lattice paths, trees or the Young graph.
Slides

Past talks
2019
2018
2017
2016
2015
2014
2013
2012
2011