L6

We study random (simple) graphs with given vertex degrees, in the sparse case where the average degree is bounded. Assume also that the second moment of the vertex degree is bounded. The standard method then is to use the configuration model to construct a random multigraph and condition it on
being simple.

This works well for results of the type that something holds with high probability, or that something converges in probability, but it does not immediately apply to convergence in distribution, for example asymptotic normality. (Although this has been done by special arguments in a couple of cases, by Janson and Luczak and by Riordan.) A typical example is the recent result by Barbour and Röllin on asymptotic normality of the size of the giant component of the multigraph (in the supercritical case); it is an obvious conjecture that the same results hold for the random simple graph.

We discuss two new approaches to this, both based on old methods. Both apply to the size of the giant component, using rather minor special arguments.

One approach uses the method of moments to obtain joint convergence of the variable of interest together with the numbers of loops and multiple edges
in the  multigraph.

The other approach uses switchings to modify the multigraph and construct a simple graph. This simple random graph will not have a uniform distribution,
but almost, and this is good enough.

Roughly speaking, a commutative-by-finite Hopf algebra is a Hopf
algebra which is an extension of a commutative Hopf algebra by a
finite dimensional Hopf algebra.
There are many big and significant classes of such algebras
(beyond of course the commutative ones and the finite dimensional ones!).
I'll make the definition precise, discuss examples
and review results, some old and some new.
No previous knowledge of Hopf algebras is necessary.
 

In his famous book on partial differential relations Gromov formulates an exercise concerning local deformations of solutions to open partial differential relations. We will explain the content of this fundamental assertion and sketch a proof. 

In the sequel we will apply this to extend local deformations of closed $G_2$ structures, and to construct 
$C^{1,1}$-Riemannian metrics which are positively curved "almost everywhere" on arbitrary manifolds. 

This is joint work with Christian Bär (Potsdam).

We recall the impact of stabilizing a 4-manifold with $S^2 \times S^2$. The corresponding local situation concerns knots in the 3-sphere which bound (nullhomotopic) discs in a stabilized 4-ball. We explain how these discs arise, and discuss bounds on the minimal number of stabilizations needed. Then we compare this minimal number to the 4-genus.
This is joint work with A. Conway.

Given a "random" polynomial over the integers, it is expected that, with high probability, it is irreducible and has a big Galois group over the rationals. Such results have been long known when the degree is bounded and the coefficients are chosen uniformly at random from some interval, but the case of bounded coefficients and unbounded degree remained open. Very recently, Emmanuel Breuillard and Peter Varju settled the case of bounded coefficients conditionally on the Riemann Hypothesis for certain Dedekind zeta functions. In this talk, I will present unconditional progress towards this problem, joint with Lior Bary-Soroker and Gady Kozma.

Gallagher's theorem is a strengthening of the Littlewood conjecture that holds for almost all pairs of real numbers. I'll discuss some recent refinements of Gallagher's theorem, one of which is joint work with Niclas Technau. A key new ingredient is the correspondence between Bohr sets and generalised arithmetic progressions. It is hoped that these are the first steps towards a metric theory of multiplicative diophantine approximation on manifolds. 

Seminal work of Hida tells us that if a modular eigenform is ordinary at p then we can always find other eigenforms, of different weights, that are congruent to our given form. Even better, it says that we can find q-expansions with coefficients in p-adic analytic function of the weight variable k that when evaluated at positive integers give the q-expansion of classical eigenforms. His construction of these families uses mainly the geometry of the modular curve and its ordinary locus.
In a joint work with Marc-Hubert Nicole, we obtained similar results for Drinfeld modular forms over function fields. After an extensive introduction to Drinfeld modules, their moduli spaces, and Drinfeld modular forms, we shall explain how to construct Hida families for ordinary Drinfeld modular forms.

The concept of an acylindrically hyperbolic group, introduced by D. Osin, generalizes hyperbolic and relatively hyperbolic groups, and includes many other groups of interest: Out(F_n), n>1, most mapping class groups, directly indecomposable non-cyclic right angled Artin groups, most graph products, groups of deficiency at least 2, etc. Roughly speaking, a group G is acylindrically hyperbolic if there is a (possibly infinite) generating set X of G such that the Cayley graph \Gamma(G,X) is hyperbolic and the action of G on it is "sufficiently nice". Many global properties of hyperbolic/relatively hyperbolic groups have been also proved for acylindrically hyperbolic groups. 
In the talk I will discuss a method which allows to construct a common acylindrically hyperbolic quotient for any countable family of countable acylindrically hyperbolic groups. This allows us to produce acylindrically hyperbolic groups with many unexpected properties.(The talk will be based on joint work with Denis Osin.)
 

A well-known conjecture in computer science and statistical physics is that Glauber dynamics on the set of k-colorings of a graph G on n vertices with maximum degree \Delta is rapidly mixing for k \ge \Delta+2. In 1999, Vigoda showed rapid mixing of flip dynamics with certain flip parameters on the set of proper k-colorings for k > (11/6)\Delta, implying rapid mixing for Glauber dynamics. In this paper, we obtain the first improvement beyond the (11/6)\Delta barrier for general graphs by showing rapid mixing for k > (11/6 - \eta)\Delta for some positive constant \eta. The key to our proof is combining path coupling with a new kind of metric that incorporates a count of the extremal configurations of the chain. Additionally, our results extend to list coloring, a widely studied generalization of coloring. Combined, these results answer two open questions from Frieze and Vigoda’s 2007 survey paper on Glauber dynamics for colorings. 

This is joint work with Michelle Delcourt and Luke Postle.