Presented by: 
Professor Peter Sarnak (Princeton)
Wed 24 Aug, 3:00 pm - 4:00 pm
222 in Parnell (7)

The Möbius function μ(n) is minus one to the number of distinct prime factors of n if n has no square factors and zero otherwise. Understanding the randomness (often referred to as the "Möbius randomness principle") in this function is a fundamental and very difficult problem. We will explain a precise dynamical formulation of this randomness principle and report on recent advances in establishing it and its applications.