University of Warwick

TBD

Complex dynamics is the study of the behaviour, under iteration, of complex polynomials and rational functions. This talk is about an application of combinatorial algebraic geometry to complex dynamics. The n-th Gleason polynomial G_n is a polynomial in one variable with Z-coefficients, whose roots correspond to degree-2 polynomials with an n-periodic critical point. Per_n is a (nodal) Riemann surface parametrizing degree-2 rational functions with an n-periodic critical point. Two long-standing open questions are: (1) Is G_n is irreducible over Q? (2) Is Per_n connected? I will sketch an argument showing that if G_n is irreducible over Q, then Per_n is connected. In order to do this, we find a special degeneration of degree-2 rational maps that tells us that Per_n has smooth point with Q-coordinates "at infinity”.

The normal covering number $\gamma(G)$ of a finite group $G$ is the minimal size of a collection of proper subgroups whose conjugates cover the group. This definition is motivated by number theory and related to the concept of intersective polynomials. For the symmetric and alternating groups we will see how these numbers are closely connected to some elementary (as in "relating to basic concepts", not "easy") problems in additive combinatorics, and we will use this connection to better understand the asymptotics of $\gamma(S_n)$ and $\gamma(A_n)$ as $n$ tends to infinity.

The Critical 2d Stochastic Heat Flow arises as a non-trivial solution
of the Stochastic Heat Equation (SHE) at the critical dimension 2 and at a phase transition point.
It is a log-correlated field which is neither Gaussian nor a Gaussian Multiplicative Chaos.
We will review the phase transition of the 2d SHE, describe the main points of the construction of the Critical 2d SHF
and outline some of its features and related questions. Based on joint works with Francesco Caravenna and Rongfeng Sun.

The objective of the talk is to present elements of Euclidean Quantum Field Theory and of the Symanzik's polymer representation for a model which includes an interaction with a magnetic field. We will explain how the problem of constructing such an EQFT can be translated into the problem of renormalising the Amperean area of a planar Brownian motion, an object that we will introduce during the talk. No prerequisite knowledge of the topic is expected.

Based on http://perso.ens-lyon.fr/isao.sauzedde/square_field3_3.pdf 

The saturation number of a graph is a famous and well-studied counterpoint to the Turán number, and the rainbow saturation number is a generalisation of the saturation number to the setting of coloured graphs. Specifically, for a given graph $F$, an edge-coloured graph is $F$-rainbow saturated if it does not contain a rainbow copy of $F$, but the addition of any non-edge in any colour creates a rainbow copy of $F$. The rainbow saturation number of $F$ is the minimum number of edges in an $F$-rainbow saturated graph on $n$ vertices. Girão, Lewis, and Popielarz conjectured that, like the saturation number, for all $F$ the rainbow saturation number is linear in $n$. I will present our attractive and elementary proof of this conjecture, and finish with a discussion of related results and open questions.

Add to calendar

Brown-Erdős-Sós initiated the study of the maximum number of edges in an $n$-vertex $r$-graph such that no $k$ edges span at most $s$ vertices. If $s=rk-2k+2$ then this function is quadratic in $n$ and its asymptotic was previously known for $k=2,3,4$. I will present joint work with Stefan Glock, Jaehoon Kim, Lyuben Lichev and Shumin Sun where we resolve the cases $k=5,6,7$.

Graph braid groups are similar to braid groups, except that they are defined as ‘braids’ on a graph, rather than the real plane. We can think of graph braid groups in terms of the discrete configuration space of a graph, which is a CW-complex. One can compute a presentation of a graph braid group using Morse theory. In this talk I will give a few examples on how to compute these presentations in terms of generating circuits of the graph. I will then go through a detailed example of a graph that gives a one-ended braid group.