# School of Mathematics

## Sparsifying and Derandomizing the Johnson-Lindenstrauss Transform

The Johnson-Lindenstrauss lemma states that for any n points in Euclidean space and error parameter 0<eps<1/2, there exists an embedding into k = O(eps^{-2} * log n) dimensional Euclidean space so that all pairwise distances are preserved up to a 1+eps factor. This lemma has applications in high-dimensional computational geometry (decreasing dimension makes many algorithms run faster), compressed sensing, and numerical linear algebra.

## CSDM: Nearly Optimal Deterministic Algorithms Via M-Ellipsoids

## Members Seminar: Linear Equations in Primes and Nilpotent Groups

## Periodic Bounce Orbits of Prescribed Energy

GEOMETRY/DYNAMICAL SYSTEMS

Periodic bounce orbits are generalizations of billiard trajectories in the presence of a potential. Using an approximation technique by Benci-Giannoni we prove existence of periodic bounce orbits of prescribed energy. At the end of the talk I will sketch very recent work in which we allow much more general Lagrangian systems including magnetic and Finsler billiards.

This is joint work with Marco Mazzucchelli.

## Learning with Boolean Threshold Functions, a Statistical Physics Perspective

Boolean Threshold Functions (BTF) arise in many contexts, ranging from computer science and learning theory to theoretical neurobiology. In this talk, I will present non-rigorous approaches developed in the statistical physics of disordered systems to characterize BTF in a quantitative way [1], with an emphasis on computational and geometrical aspects. These techniques will be illustrated on two particular cases: the celebrated perceptron (Linear Threshold Function) [2], and the more realistic tempotron model of a neuron [3,4].

## Groups of Even Type of Medium Size

In this talk we will discuss recent progresses meant as a contribution to the GLS-project, the second generation proof of the Classification of Finite Simple Groups (jointly with R. Lyons, R. Solomon, Ch. Parker).

## The Cartan Geometry of the Rotating Kepler Problem

GEOMETRY/DYNAMICAL SYSTEMS

In this talk we shall discuss the Cartan geometry of the rotating Kepler problem. The rotating Kepler problem appears as the limit of the restricted planar three-body body when one of the masses goes to zero. As such, this problem plays the role of a simple approximation. We shall discuss the Cartan curvature and some of its relations with indices in the three-body problem. This is joint work with Kai Cieliebak and Urs Frauenfelder.

## Local-Global Compatibility and Monodromy

Given a cuspidal automorphic representation of GL(n) which is regular algebraic and conjugate self-dual, one can associate to it a Galois representation. This Galois representation is known in most cases to be compatible with local Langlands. When n is even, the compatibility is known up to semisimplification or when the representation satisfies an additional regularity condition. I will extend the compatibility to Frobenius semisimplification by identifying the monodromy operators.

## Mechanizing the Odd Order Theorem: Local Analysis

Abstract: In addition to formal definitions and theorems, mathematical theories also contain clever, context-sensitive notations, usage conventions, and proof methods. To mechanize advanced mathematical results it is essential to capture these more informal elements. This can be difficult, requiring an array of techniques closer to software engineering than formal logic, but it is essential to obtaining formal proofs of graduate-level mathematics, and can give new insight as well.