Large sieve inequalities are a fundamental tool used to investigate prime numbers and exponential sums. I will explain my work that resolves a 1978 conjecture of S. Patterson (conditional on the Generalized Riemann hypothesis) concerning the bias of cubic Gauss sums. This explains a well-known numerical bias first observed by Kummer in 1846. One important byproduct of my work is a proof that
This talk is about the arithmetic of points of small canonical height relative to dynamical systems over number fields, particularly those aspects amenable to the use of equidistribution techniques. Past milestones in the subject include the proof of the Bogomolov Conjecture given by Ullmo and Zhang, and Baker-DeMarco's work on the finiteness of common preperiodic points of unicritical maps.
Given an action of a finite group $G$ on a complex vector space $V$, the Chevalley-Shephard-Todd Theorem gives a beautiful characterization for when the quotient variety $V/G$ is smooth. In his 1986 ICM address, Popov asked whether this criterion could be extended to the case of Lie groups. I will discuss my contributions to this problem and some intriguing questions in combinatorics that this raises. This is based on joint work with Dan Edidin.
