RESEARCH INTERESTS

Alexander Gamburd 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.

HONORS

Presidential Early Career Award

NSF CAREER

Sloan Research Foundation Fellowship

Von Neumann Early Career Fellowship

PREPRINTS

https://sites.google.com/view/agamburd/home/bourgain