October 2017 November 2017 December 2017 Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa Su Mo Tu We Th Fr Sa 1 2 3 4 5 6 7 1 2 3 4 1 2 8 9 10 11 12 13 14 5 6 7 8 9 10 11 3 4 5 6 7 8 9 15 16 17 18 19 20 21 12 13 14 15 16 17 18 10 11 12 13 14 15 16 22 23 24 25 26 27 28 19 20 21 22 23 24 25 17 18 19 20 21 22 23 29 30 31 26 27 28 29 30 24 25 26 27 28 29 30 31 |

4:00 pm Tuesday, November 28, 2017 AGNT: The unreasonable effectiveness of the Polya-Vinogradov inequalityby Leo Goldmakher (Williams College) in HBH 227- The Polya-Vinogradov inequality, an upper bound on character sums proved a century ago, is essentially optimal. Unfortunately, it's also not so useful in applications, since it's nontrivial only on long sums (while in practice one usually needs estimates on sums which are as short as possible). The best tool we have to handle shorter sums is the Burgess bound, discovered in 1957; this is generally considered to supersede Polya-Vinogradov, both because its proof is "deeper" (building on results from algebraic geometry) and because it is more applicable. In this talk I will introduce and motivate both of these bounds, and then describe the unexpected result (joint with Elijah Fromm, Williams '17) that even a tiny improvement of the (allegedly weaker) Polya-Vinogradov inequality would imply a major improvement of the (supposedly superior) Burgess bound. I'll also discuss a related connection between improving Polya-Vinogradov and the classical problem of bounding the least quadratic nonresidue (joint with Jonathan Bober, University of Bristol).
Submitted by ae22@rice.edu |