Better than squareroot cancellation for multiplicative functions
Location: MSRI: Simons Auditorium
random multiplicative function
It is a standard heuristic that sums of oscillating number theoretic functions, like the M\"obius function or Dirichlet characters, should exhibit squareroot cancellation. It is often very difficult to prove anything as strong as that, and we generally expect that if we could prove squareroot cancellation it would be the best possible bound. I will discuss recent results showing that, in fact, certain averages of multiplicative functions exhibit a bit more than squareroot cancellation
If none of the options work for you, you can always buy the DVD of this lecture. The videos are sold at cost for $20USD (shipping included). Please Click Here to send an email to MSRI to purchase the DVD.
See more of our Streaming videos on our main VMath - Streaming Video page.