In 1993, Erdős, Sárközy and Sós posed the question of whether there exists a set $S$ of positive integers that is both a Sidon set and an asymptotic basis of order $3$. This means that the sums of two elements of $S$ are all distinct, while the sums of three elements of $S$ cover all sufficiently large integers. In this talk, I will present a construction of such a set, building on ideas of Ruzsa and Cilleruelo. The proof uses a powerful number-theoretic result of Sawin, which is established using cutting-edge algebraic geometry techniques.

Serre's conjecture (now a theorem) predicts that an irreducible 2-dimensional odd
Galois representation of $\mathbb Q$ with coefficients in $\bar{\mathbb F}_p$ comes from the mod p reduction of
a modular form. A key feature is that two modular forms of different weights can have the same
mod p reduction. Fixing a modular form $f$, the weight part of Serre's conjecture seeks to find all
the possible weights where one can find a modular form congruent to $f$ mod $p$. The recipe for these
weights was conjectured by Serre, and it depends only on the local Galois representation at $p$. I
will explain the ideas involved in Edixhoven's proof of the weight part, and if time allows, I
will briefly say something about what the generalizations beyond $\operatorname{GL}_2/\mathbb Q$ might look like. 

The Calogero-Painlevé systems were introduced in 2001 by K. Takasaki as a natural generalization of the classical Painlevé equations to the case of the several Painlevé “particles” coupled via the Calogero type interactions. In 2014, I. Rumanov discovered a remarkable fact that a particular case of the Calogero– Painlevé II equation describes the Tracy-Widom distribution function for the general $\beta$-ensembles with the even values of parameter $\beta$. in 2017 work of M. Bertola, M. Cafasso , and V. Rubtsov, it was proven that all Calogero-Painlevé systems are Lax integrable, and hence their solutions admit a Riemann-Hilbert representation. This important observation has opened the door to rigorous asymptotic analysis of the Calogero-Painlevé equations which in turn yields the possibility of rigorous evaluation of the asymptotic behavior of the Tracy-Widom distributions for the values of $\beta$ beyond the classical $\beta =1, 2, 4$. In the talk these recent developments will be outlined with a special focus on the Calogero-Painlevé system corresponding to $\beta = 6$. This is a joint work with Andrei Prokhorov.

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.