Van H. Vu
Van H. Vu (Vietnamese: Vũ Hà Văn) is a Vietnamese mathematician, Percey F. Smith Professor of Mathematics at Yale University.[1]
Education and career
Vu graduated at the Eötvös University, Budapest, in 1994, his M.Sc. thesis supervisor was Tamás Szőnyi. He received his Ph.D. at Yale University, in 1998 under the direction of László Lovász (another Polya prize winner).[1][2] He worked as a postdoc at IAS and Microsoft Research (1998-2001). He joined the University of California, San Diego as an assistant professor in 2001 and was promoted to full professor in 2005. In Fall 2005, he moved to Rutgers University and stayed there until he joined Yale in Fall 2011. Vu was a member at IAS on three occasions (1998, 2005, 2007), the last time (2007) as the leader of the special program Arithmetic Combinatorics [1]
Contributions
In 2010, Terence Tao and Vu solved the circular law conjecture.
Awards and honors
In 2008 Vu was awarded the Pólya Prize of the Society for Industrial and Applied Mathematics for his work on concentration of measure.[3]
In 2012, Vu was awarded the Fulkerson Prize (jointly with Anders Johansson and Jeff Kahn) for determining the threshold of edge density above which a random graph can be covered by disjoint copies of a given smaller graph. Also in 2012, he became a fellow of the American Mathematical Society.[4]
References
- 1 2 3 CV from Vu's web site
- ↑ Van Vu at the Mathematics Genealogy Project.
- ↑ Pólya Prize, SIAM.
- ↑ List of Fellows of the American Mathematical Society, retrieved 2013-08-29.