Description
This online seminar on probability and algebraic structures is usually scheduled at 11:00 EST on Wednesday.
For the Zoom link and updates on future seminars, one can subscribe at the following mailing list: https://listserv.uni-muenster.de/mailman/listinfo/probability-algebra-seminar.
The seminar is organized by Nikita Lvov (McGill University) and Alexander Van Werde (University of Münster).
Upcoming talks:
November 4: Charles Bordenave (CNRS & Aix-Marseille Université, France)
The monotone labelling method in spectral graph theory
Monotone labelling is a technique originated from an ancient joint work with Arnab Sen and Balint Virag originally designed to upper bound the mass of atoms in the spectrum of infinite random trees. It was recently found that it could be used to study the log Hölder regularity of the spectral measure of a large class of (possibly random) operators invariant under a group action. This has led to striking new results.
In this talk, I will review these recent progresses and explain how this method works. Talk partially based on a joint work with Wenbo Li and Joe Thomas.
November 18: Daniel Loughran (University of Bath, UK)
The Cohen-Lenstra heuristics via algebraic stacks
Abstract: TBA
December 16: Isaac Rajagopal (MIT, USA)
Cohen—Lenstra universality for partially random integral matrices
Abstract: TBA
Past talks:
October 14: Carlo Pagano (Concordia University, Canada)
Random profinite groups are finitely presented with probability 1
I will present joint recent work with M. Shusterman where we establish that, for fairly general models of random profinite groups, one has that they are (topologically) finitely generated almost surely. When one considers the models of Liu--Wood--Zureick-Brown and Sawin--Wood one obtains that they are finitely presented almost surely and with a precise control on the defect of the presentation.
About the banner image:
The banner image is based on the identity element of the sandpile group of a grid graph. The random algebraic objects given by the sandpile groups of random graphs turns out to have fascinating connections to algebraic number theory, related to the Cohen-Lenstra conjectures for class groups of number fields.
The image is due to Wikimedia commons user colt_browning, accessible at https://commons.wikimedia.org/wiki/File:Sandpile_group_identity_on_4096x4096_grid.png