Each year Prof. Trefethen gives the Problem Solving Squad a sequence of problems with no hints, one a week, where the solution of each problem is a single real number to be computed by any method available.  We will present this year's three problems, involving (1) an S-shaped bifurcation curve, (2) shortest path around a random web, and (3) switching a time-varying system to maximize a matrix norm.

The 14 students this year are Simon Vary plus InFoMM cohort 2: Matteo Croci, Davin Lunz, Michael McPhail, Tori Pereira, Lindon Roberts, Caoimhe Rooney, Ian Roper, Thomas Roy, Tino Sulzer, Bogdan Toader, Florian Wechsung, Jess Williams, and Fabian Ying.  The presentations will be by (1) Lindon Roberts, (2) Florian Wechsung, and (3) Thomas Roy.

We present some dimensionality reduction techniques for global optimization algorithms, in order to increase their scalability. Inspired by ideas in machine learning, and extending the approach of random projections in Zhang et al (2016), we present some new algorithmic approaches for global optimisation with theoretical guarantees of good behaviour and encouraging numerical results.
 

Given a representation of Gal_{Q_p} with coefficients in a p-adically complete local ring R, Fukaya and Kato have conjectured the existence of a canonical trivialization of the determinant of a certain cohomology complex.  When R=Z_p and the representation is a lattice in a de Rham representation, this trivialization should be related to the \varepsilon-factor of the corresponding Weil--Deligne representation.  Such a trivialization has been constructed for certain crystalline Galois representations, by the work of a number of authors. I will explain how to extend these trivializations to certain families of crystalline Galois representations.  This is joint work with Otmar Venjakob.