Galois Characterization of Henselian Fields
Abstract
I will talk about Jochen’s theorem about the existence of some non-trivial Henselian valuation given by investigating the absolute Galois group.
I will talk about Jochen’s theorem about the existence of some non-trivial Henselian valuation given by investigating the absolute Galois group.
In the talk I will give an introduction to the Manin-Mumford conjecture and to the Pila-Zannier strategy for attacking it in the case of products of elliptic curves. if the permits it, I will also speak about how this same strategy has allowed to attack the analogous André-Oort conjecture for Shimura Varieties of abelian type.
I will discuss a couple of techniques often useful to prove quasi-isometric rigidity results for isometry groups. I will then sketch how these were used by B. Kleiner and B. Leeb to obtain quasi-isometric rigidity for the class of fundamental groups of closed locally symmetric spaces of noncompact type.
The chromatic number of the Erdős–Rényi random graph G(n,p) has been an intensely studied subject since at least the 1970s. A celebrated breakthrough by Bollobás in 1987 first established the asymptotic value of the chromatic number of G(n,1/2), and a considerable amount of effort has since been spent on refining Bollobás' approach, resulting in increasingly accurate bounds. Despite this, up until now there has been a gap of size O(1) in the denominator between the best known upper and lower bounds for the chromatic number of dense random graphs G(n,p) where p is constant. In contrast, much more is known in the sparse case.
In this talk, new upper and lower bounds for the chromatic number of G(n,p) where p is constant will be presented which match each other up to a term of size o(1) in the denominator. In particular, they narrow down the optimal colouring rate, defined as the average colour class size in a colouring with the minimum number of colours, to an interval of length o(1). These bounds were obtained through a careful application of the second moment method rather than a variant of Bollobás' method. Somewhat surprisingly, the behaviour of the chromatic number changes around p=1-1/e^2, with a different limiting effect being dominant below and above this value.
There is an obvious product-free subset of the symmetric group of density 1/2, but what about the alternating group? An argument of Gowers shows that a product-free subset of the alternating group can have density at most n^(-1/3), but we only know examples of density n^(-1/2 + o(1)). We'll talk about why in fact n^(-1/2 + o(1)) is the right answer, why
Gowers's argument can't prove that, and how this all fits in with a more general 'product mixing' phenomenon. Our tools include some nonabelian Fourier analysis, a version of entropy subadditivity adapted to the symmetric group, and a concentration-of-measure result for rearrangements of inner products.
Fix some positive integer r. A famous theorem of Schur states that if you partition Z/pZ into r colour classes then, provided p > p_0(r) is sufficiently large, there is a monochromatic triple {x, y, x + y}. By essentially the same argument there is also a monochromatic triple {x', y', x'y'}. Recently, Tom Sanders and I showed that in fact there is a
monochromatic quadruple {x, y, x+y, xy}. I will discuss some aspects of the proof.