Kerdock matrices are an attractive choice as deterministic measurement matrices for compressive sensing. I'll explain how Kerdock matrices are constructed, and then show how they can be adapted to one particular  strategy for quantizing measurements, in which measurements exceeding the desired dynamic range are rejected.

I will talk about a remarkable theorem by Paulin, which says
that if a one-ended hyperbolic group has infinite outer automorphism
group, then it splits over a two-ended subgroup. In particular, this
gives a condition which ensures a hyperbolic group doesn't have property
(T).

 I will talk about Jochen’s theorem about the existence of some non-trivial Henselian valuation given by investigating the absolute Galois group.

Using the "trichotomy principle" by Boris Zilber I will give model theoretic proofs of appropriate versions of Torelli theorem and Borel-Tits theorem. The first one has interesting applications to anabelian geometry, I won't assume any prior knowledge in model theory.

I'll explain the formalism of extended QFT, while
focusing on the cases of two dimensional conformal field theories,
and three dimensional topological field theories.

Efficient factorization or efficient computation of class 
numbers would both suffice to break RSA.  However the talk lies more in 
computational number theory rather than in cryptography proper. We will 
address two questions: (1) How quickly can one construct a factor table 
for the numbers up to x?, and (2) How quickly can one do the same for the 
class numbers (of imaginary quadratic fields)? Somewhat surprisingly, the 
approach we describe for the second problem is motivated by the classical 
Hardy-Littlewood method.