26 novembre 2016 de 16 h 00 à 18 h 00 (heure de Montréal/HNE) Sur place
Colloque par Maksym Radziwill (McGill University)
The Moebius function plays a central role in number theory; both the prime number theorem and the Riemann Hypothesis are naturally formulated in terms of the amount of cancellations one gets when summing the Moebius function. In recent joint work with K. Matomaki the speaker showed that the sum of the Moebius function exhibits cancellations in "almost all intervals'' of increasing length. This goes beyond what was previously known conditionally on the Riemann Hypothesis. The result holds in fact in greater generality. Exploiting this generality one can show that between a fixed number of consecutive squares there is always an integer composed of only "small'' prime factors. This is related to the running time of Lenstra's factoring algorithm. I will also discuss some further developments : the work of Tao on correlations between consecutive values of Chowla, and his application of this result to the resolution of the Erdos discrepancy problem.
AdresseUQAM, Pavillon Président-Kennedy, 201, ave du Président-Kennedy, salle PK5115