You are currently browsing the tag archive for the ‘Alexander Gamburd’ tag.

In this final lecture in the Marker lecture series, I discuss the recent work of Bourgain, Gamburd, and Sarnak on how arithmetic combinatorics and expander graphs were used to sieve for almost primes in various algebraic sets.

Read the rest of this entry »