|Joint IAS/Princeton University Number Theory Seminar|
|Topic:||Around the Moebius function|
|Date:||Thursday, February 26|
|Time/Room:||4:30pm - 5:30pm/Fine 214, Princeton 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 we have shown 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 and allows us to settle a conjecture on correlations of consecutive values of the Liouville function (a close cousin of Moebius function). Our result holds in fact in greater generality. Exploiting this generality we show that between a fixed number of consecutive squares there is always an integer composed of only "small" prime factors. This settles a conjecture on "smooth numbers" and is related to the running time of Lenstra's factoring algorithm. Finally, in recent on-going work with K. Matomaki and T. Tao we have been able to use the previously-mentioned general result to show that Chowla's conjecture (on correlations of the Moebius function) holds on average and we strengthened previous results on patterns in the Liouville function.