Mon, 25 Feb 2013

12:00 - 13:00
L3

Fenchel-Nielsen coordinates from spectral networks

Lotte Hollands
(Oxford)
Abstract
Fenchel-Nielsen coordinates play a central role in constructing partition functions for theories of class S with gauge group SU(2). Having an analogue of these coordinates for higher rank gauge groups is a first step in finding partition functions for strongly coupled gauge theories of the Minahan-Nemeschansky type. We find such a generalization through the formalism of spectral networks and the non-abelianization map, that was originally introduced by Gaiotto, Moore and Neitzke to find a better understanding of BPS states in the theories of class S. This is joint work with Andy Neitzke.
Mon, 11 Feb 2013

15:45 - 16:45
L3

Quasi-hyperbolic planes in hyperbolic and relatively hyperbolic groups

John MacKay
(Oxford)
Abstract

In 2005, Bonk and Kleiner showed that a hyperbolic group admits a

quasi-isometrically embedded copy of the hyperbolic plane if and only if the

group is not virtually free. This answered a question of Papasoglu. I will

discuss a generalisation of their result to certain relatively hyperbolic

groups (joint work with Alessandro Sisto). Key tools involved are new

existence results for quasi-circles, and a better understanding of the

geometry of boundaries of relatively hyperbolic groups.

Tue, 19 Feb 2013

14:30 - 15:30
L3

Bootstrap percolation on infinite trees

Karen Johannson
(Bristol)
Abstract

While usual percolation concerns the study of the connected components of

random subgraphs of an infinite graph, bootstrap percolation is a type of

cellular automaton, acting on the vertices of a graph which are in one of

two states: `healthy' or `infected'. For any positive integer $r$, the

$r$-neighbour bootstrap process is the following update rule for the

states of vertices: infected vertices remain infected forever and each

healthy vertex with at least $r$ infected neighbours becomes itself

infected. These updates occur simultaneously and are repeated at discrete

time intervals. Percolation is said to occur if all vertices are

eventually infected.

As it is often difficult to determine precisely which configurations of

initially infected vertices percolate, one often considers a random case,

with each vertex infected independently with a fixed probability $p$. For

an infinite graph, of interest are the values of $p$ for which the

probability of percolation is positive. I will give some of the history

of this problem for regular trees and present some new results for

bootstrap percolation on certain classes of randomly generated trees:

Galton--Watson trees.

Thu, 07 Mar 2013

16:00 - 17:00
L3

Conditional bounds for the Riemann zeta-function via Fourier analysis.

Emanuel Carneiro
(Brazil)
Abstract

In this talk I will present the best up-to-date bounds for the argument of the Riemann zeta-function on the critical line, assuming the Riemann hypothesis. The method applies to other objects related to the Riemann zeta-function and uses certain special families of functions of exponential type. This is a joint work with Vorrapan Chandee (Montreal) and Micah Milinovich (Mississipi).

Subscribe to L3