Alexander Gamburd is a professor in the CUNY Graduate Center’s Department of Mathematics. He specializes in spectral problems in number theory, probability, and combinatorics. His recent work concerns expander graphs, which are highly connected sparse graphs with wide-ranging applications in computer science and mathematics, and his research has resolved major conjectures in proving expansion for Cayley graphs by using recently developed tools from arithmetic combinatorics. This work has a number of applications, in particular in quantum computation theory of quasi-crystals and distribution of prime numbers in non-abelian groups. In 2008 he was awarded the Presidential Early Career Award for Scientists and Engineers (PECASE).  Publications include, with J. Bourgain, “Uniform Expansion Bounds for Cayley Graphs of SL2(Fp)” in Annals of Mathematics, 167 (2008), and together with J. Bourgain and P. Sarnak, “Affine Linear Sieve, Expanders and Sum-Product” in Inventiones Mathematicae 179 (2010).