C5

This talk will discuss the discovery of Heegner points from a historic perspective. They are a beautiful application of analytic techniques to the study of rational points on elliptic curves, which is now a ubiquitous theme in number theory. We will start with a historical account of elliptic curves in the 60's and 70's, and a correspondence between Birch and Gross, culminating in the Gross-Zagier formula in the 80's. Time permitting, we will discuss certain applications and ramifications of these ideas in modern number theory. 

We define the notion of orbit decidability in a general context, and descend to the case of groups to recognise it into several classical algorithmic problems. Then we shall go into the realm of free groups and shall analise this notion there, where it is related to the Whitehead problem (with many variations). After this, we shall enter the negative side finding interesting subgroups which are orbit undecidable. Finally, we shall prove a theorem connecting orbit decidability with the conjugacy problem for extensions of groups, and will derive several (positive and negative) applications to the conjugacy problem for groups.

In this talk, I will explain part of the programme of Gorenstein, Lyons

and Solomon (GLS) to provide a new proof of the CFSG. I will focus on

the difference between the initial notion of groups of characteristic

$2$-type (groups like Lie type groups of characteristic $2$) and the GLS

notion of groups of even type. I will then discuss work in progress

with Capdeboscq to study groups of even type and small $2$-local odd

rank. As a byproduct of the discussion, a picture of the structure of a

finite simple group of even type will emerge.

For a finitely presented group, the Word Problem asks for an algorithm

which declares whether or not words on the generators represent the

identity. The Dehn function is the time-complexity of a direct attack

on the Word Problem by applying the defining relations.

A "hydra phenomenon" gives rise to novel groups with extremely fast

growing (Ackermannian) Dehn functions. I will explain why,

nevertheless, there are efficient (polynomial time) solutions to the

Word Problems of these groups. The main innovation is a means of

computing efficiently with compressed forms of enormous integers.

This is joint work with Will Dison and Eduard Einstein.

In 1997 V. Bentkus and F. Götze introduced a technique for estimating $L^p$ norms of certain exponential sums without needing an explicit estimate for the exponential sum itself. One uses instead a kind of estimate I call a "moat lemma". I explain this term, and discuss the implications for several kinds of point-counting problem which we all know and love.

Hrushovski-Martin-Rideau have proved rationality of Poincare series counting 
numbers of equivalence classes of a definable equivalence relation on the p-adic field (in connection to a problem on counting representations of groups). For this they have proved 
uniform p-adic elimination of imaginaries. Their work implies that these Poincare series are 
motivic. I will talk about their work.