We discuss a recent preprint by Aschenbrenner, Khélif, Naziazeno and
Scanlon, giving a positive solution to the ring-analogue of Pop's
problem on elementary equivalence vs isomorphism. 

Lagrangian Floer cohomology groups are extremely hard compute in most situations. In this talk I’ll describe two ways to extract information about the self-Floer cohomology of a monotone Lagrangian possessing certain kinds of symmetry, based on the closed-open string map and the Oh spectral sequence. The focus will be on a particular family of examples, where the techniques can be combined to deduce some unusual properties.

Coisotropic submanifolds arise naturally in symplectic geometry as level sets of moment maps and in algebraic geometry in the context of normal crossing divisors. In examples, the Marsden-Weinstein quotient or (Fano) complete intersections are often uniruled. 
We show that under natural geometric assumptions on a coisotropic submanifold, the symplectic quotient of the coisotropic is always geometrically uniruled. 
I will explain how to assign a Lagrangian and a hypersurface to a fibered, stable coisotropic C. The Lagrangian inherits a fibre bundle structure from C, the hypersurface captures the generalised Reeb dynamics on C. To derive the result, we then adapt and apply techniques from Lagrangian Floer theory and symplectic field theory.
This is joint work with Jonny Evans.
 

In this lecture, we present  practical and provably
secure (authenticated) key exchange protocol and password
authenticated key exchange protocol, which are based on the
learning with errors problems. These protocols are conceptually
simple and have strong provable security properties.
This type of new constructions were started in 2011-2012.
These protocols are shown indeed practical.  We will explain
that all the existing LWE based key exchanges are variants
of this fundamental design.  In addition, we will explain
some issues with key reuse and how to use the signal function
invented for KE for authentication schemes.

What's the continuous analog of randn?  In recent months I've been exploring such questions with Abdul-Lateef Haji-Ali and other members of the Chebfun team, and Chebfun now has commands randnfun, randnfun2, randnfunsphere, and randnfundisk.  These are based on finite Fourier series with random coefficients, and interesting questions arise in the "white noise" limit as the lengths of the series approaches infinity and as random ODEs become stochastic DEs.    This work is at an early stage and we are grateful for input from stochastic experts at Oxford and elsewhere.