Oxford

The talk will discuss generalizations of the classical Hadamard jump  condition to general locally Lipschitz maps, and applications to
polycrystals. This is joint work with Carsten Carstensen.

A nice bed-time story to end the term. It is often said that ideas like the group law or isogenies on elliptic curves were 'known to Fermat' or are 'found
in Diophantus', but this is rarely properly explained. I will discuss the first work on rational points on curves from the point of view of modern number
theory, asking if it really did anticipate the methods we use today.

Rainbow connectivity is a new concept for measuring the connectivity of a graph which was introduced in 2008 by Chartrand, Johns, McKeon and Zhang. In a graph G with a given edge colouring, a rainbow path is a path all of whose edges have distinct colours. The minimum number of colours required to colour the edges of G so that every pair of vertices is joined by at least one rainbow path is called the rainbow connection number rc(G) of the graph G.

For any graph G, rc(G) >= diam(G). We will discuss rainbow connectivity in the random graph setting and present the result that for random graphs, rainbow connectivity 2 happens essentially at the same time as diameter 2. In fact, in the random graph process, with high probability the hitting times of diameter 2 and of rainbow connection number 2 coincide