The size of the maximum of character sums
![Thumbnail](/static/img/default.jpg)
Event details
Date | 05.02.2015 |
Hour | 14:15 › 15:15 |
Speaker | Jonathan Bober |
Location | |
Category | Conferences - Seminars |
I will talk about how often sums of Dirichlet characters are large and say hopefully some things about the characters which have large sums. In slightly more detail: For a Dirichlet character \chi mod \q, let M(\chi) denote the maximum (over x) of |\sum_{n < x} \chi(n)| and let N_\chi be a value of x at which the maximum is attained. It turns out that M(\chi)/\sqrt{q} has a limiting distribution and N_\chi has some interesting behavior. I'll say some things about this distribution and the characters which contribute to the tail.
This talk will be mostly or entirely about joint work with Leo Goldmakher, Andrew Granville, and Dimitris Koukoulopoulos.
This talk will be mostly or entirely about joint work with Leo Goldmakher, Andrew Granville, and Dimitris Koukoulopoulos.
Practical information
- Informed public
- Free
Organizer
- Prof. Eva Bayer Fluckiger
Contact
- Natascha Fontana