Previous Conferences & Workshops

In this talk, we will discuss the computation of motivic stable homotopy groups and their applications in classical computations. Specifically, we will discuss an example of complex motivic applications in classical theory, the Adams spectral...

In 1976, Gérard Rauzy proved a characterization of deterministic numbers: y is deterministic iff for any normal number x, x+y is also normal. During my lecture I willdiscuss  how normal and deterministic numbers behave under arithmetic operations. ...

In its dynamical formulation, the Furstenberg—Sárközy theorem states that for any invertible measure-preserving system $(X, \mu, T)$, any set $A \subseteq X$ with $\mu(A) > 0$, and any integer polynomial $P$ with $P(0) = 0$,
$$c(A) = \lim_{N-M \to...

We prove the existence of subspace designs with any given parameters, provided that the dimension of the underlying space is sufficiently large in terms of the other parameters of the design and satisfies the obvious necessary divisibility...

The Zimmer program asks how lattices in higher rank semisimple Lie groups may act smoothly on compact manifolds. Below a certain critical dimension, the recent proof of the Zimmer conjecture by Brown-Fisher-Hurtado asserts that, for SL(n,R) with n...

Erdős' unit distance problem and his related distinct distances problem are arguably the best known open problems in discrete geometry.

They ask for the maximum possible number of unit distances, and the minimum possible number of distinct...