L6

In this talk I will give an overview of Seba's billiard as a popular model in the field of Quantum Chaos. Consider a rectangular billiard with a Dirac mass placed in its interior. Whereas this mass has essentially no effect on the classical dynamics, it does have an effect on the quantum dynamics, because quantum wave packets experience diffraction at the point obstacle. Numerical investigations of this model by Petr Seba suggested that the spectrum and the eigenfunctions of the Seba billiard resemble the spectra and eigenfunctions of billiards which are classically chaotic.

I will give an introduction to this model and discuss recent results on quantum ergodicity, superscars and the validity of Berry's random wave conjecture. This talk is based on joint work with Par Kurlberg and Zeev Rudnick.

I will report on recent joint work with Karen Vogtmann on the Euler characteristic of $Out(F_n)$ and the moduli space of graphs. A similar study has been performed in the seminal 1986 work of Harer and Zagier on the Euler characteristic of the mapping class group and the moduli space of curves. I will review a topological field theory proof, due to Kontsevich, of Harer and Zagier´s result and illustrate how an analogous `renormalized` topological field theory argument can be applied to $Out(F_n)$.

We present a programme towards a combinatorial language for higher (stratified) Morse-Cerf theory. Our starting point will be the interpretation of a Morse function as a constructible bundle (of manifolds) over R^1. Generalising this, we describe a surprising combinatorial classification of constructible bundles on flag foliated R^n (the latter structure of a "flag foliation” is needed for us to capture the notions of "singularities of higher Morse-Cerf functions" independently of differentiable structure). We remark that flag foliations can also be seen to provide a notion of directed topology and in this sense higher Morse-Cerf singularities are closely related to coherences in higher category theory. The main result we will present is the algorithmic decidability of existence of mutual refinements of constructible bundles. Using this result, we discuss how "combinatorial stratified higher Morse-Cerf theory" opens up novel paths to the computational treatment of interesting questions in manifold topology.

The tunnel number of a graph embedded in a 3-dimensional manifold is the fewest number of arcs needed so that the union of the graph with the arcs has handlebody exterior. The behavior of tunnel number with respect to connected sum of knots can vary dramatically, depending on the knots involved. However, a classical theorem of Scharlemann and Schultens says that the tunnel number of a composite knot is at least the number of factors. For theta graphs, trivalent vertex sum is the operation which most closely resembles the connected sum of knots. The analogous theorem of Scharlemann and Schultens no longer holds, however. I will provide a sharp lower bound for the tunnel number of composite theta graphs, using recent work on a new knot invariant which is additive under connected sum and trivalent vertex sum. This is joint work with Maggy Tomova.

Decision problems – those in which the goal is to return an answer of “YES" or “NO" – are at the heart of the theory of computational complexity, and remain the most studied problems in the theoretical algorithms community. However, in many real-world applications it is not enough just to decide whether the problem under consideration admits a solution: we often want to find all solutions, or at least count (either exactly or approximately) their  total number. It is clear that finding or counting all solutions is at least as computationally difficult as deciding whether there exists a single solution, and  indeed in many cases it is strictly harder (assuming P is not equal NP) even to count approximately the number of solutions than it is to decide whether there exists at least one.

In this talk I will discuss a restricted family of problems, in which we are interested in solutions of a given size: for example, solutions could be copies of a specific k-vertex graph H in a large host graph G, or more generally k-vertex subgraphs of G that have some specified property (e.g. k-vertex subgraphs that are connected). In this setting, although exact counting is strictly harder than decision (assuming standard assumptions in parameterised complexity), the methods typically used to separate approximate counting from decision break down. Indeed, I will demonstrate a method that, subject to certain additional assumptions, allows us to transform an efficient decision algorithm for a problem of this form into an approximate counting algorithm with essentially the same running time.

This is joint work with John Lapinskas (Bristol) and Holger Dell (ITU Copenhagen).

I will give a brief survey of some problems in curvature free geometry and sketch

a new proof of the following:

Theorem (Guth). There is some $\delta (n)>0$ such that if $(M^n,g)$ is a closed aspherical Riemannian manifold and $V(R)$ is the volume of the largest ball of radius $R$ in the universal cover of $M$, then $V(R)\geq \delta(n)R^n$ for all $R$.

I will also discuss some recent related questions and results.