Let $f_1,\dots,f_k$ be real polynomials with no constant term and degree at most $d$. We will talk about work in progress showing that there are integers $n$ such that the fractional part of each of the $f_i(n)$ is very small, with the quantitative bound being essentially optimal in the $k$-aspect. This is based on the interplay between Fourier analysis, Diophantine approximation and the geometry of numbers. In particular, the key idea is to find strong additive structure in Fourier coefficients.

# Number Theory Seminar

Please note that the list below only shows forthcoming events, which may not include regular events that have not yet been entered for the forthcoming term. Please see the past events page for a list of all seminar series that the department has on offer.

Let $P$ be a random polynomial of degree $d$ such that the leading and constant coefficients are 1 and the rest of the coefficients are independent random variables taking the value 0 or 1 with equal probability. Odlyzko and Poonen conjectured that $P$ is irreducible with probability tending to 1 as $d$ grows. I will talk about an on-going joint work with Emmanuel Breuillard, in which we prove that GRH implies this conjecture. The proof is based on estimates for the mixing time of random walks on $\mathbb{F}_p$, where the steps are given by the maps $x \rightarrow ax$ and $x \rightarrow ax+1$ with equal probability.

It is an old problem in number theory to count number fields of a fixed degree and having a fixed Galois group for its Galois closure, ordered by their absolute discriminant, say. In this talk, I shall discuss some background of this problem, and then report a recent work with Stanley Xiao. In our paper, we considered quartic $D_4$-fields whose ring of integers has a certain nice algebraic property, and we counted such fields by their conductor.