Université de Montréal

I will review notions of categorical complexity, and the more recent work of Biran, Cornea and Zhang on fragmentation in triangulated persistence categories (TPCs), then go on to discuss applications of this to filtered topology. In particular, we will consider a suitable category of filtered topological spaces and detail some constructions and properties, before showing that an associated 'filtered stable homotopy category' is a TPC. I will then give some interesting results relating to this.

Abstract. I will talk about projects in which we combine heuristics with computational data to develop a theory in problems where it was previously hard to be confident of the guesses that there are in the literature.

1/ "Speculations about the number of primes in fast growing sequences". Starting from studying the distribution of primes in sequences like $2^n-3$, Jon Grantham and I have been developing a heuristic to guess at the frequency of prime values in arbitrary linear recurrence sequences in the integers, backed by calculations.

If there is enough time I will then talk about:

2/ "The spectrum of the $k$th roots of unity for $k>2$, and beyond".  There are many questions in analytic number theory which revolve around the "spectrum", the possible mean values of multiplicative functions supported on the $k$th roots of unity. Twenty years ago Soundararajan and I determined the spectrum when $k=2$, and gave some weak partial results for $k>2$, the various complex spectra.  Kevin Church and I have been tweaking MATLAB's package on differential delay equations to help us to develop a heuristic theory of these spectra for $k>2$, allowing us to (reasonably?) guess at the answers to some of the central questions.

We describe how Smith theory applies in the setting of Hamiltonian Floer homology filtered by the action functional, and provide applications to questions regarding Hamiltonian diffeomorphisms, including the Hofer-Zehnder conjecture on the existence of infinitely many periodic points and a question of McDuff-Salamon on Hamiltonian diffeomorphisms of finite order.

Given a "random" polynomial over the integers, it is expected that, with high probability, it is irreducible and has a big Galois group over the rationals. Such results have been long known when the degree is bounded and the coefficients are chosen uniformly at random from some interval, but the case of bounded coefficients and unbounded degree remained open. Very recently, Emmanuel Breuillard and Peter Varju settled the case of bounded coefficients conditionally on the Riemann Hypothesis for certain Dedekind zeta functions. In this talk, I will present unconditional progress towards this problem, joint with Lior Bary-Soroker and Gady Kozma.