Igor Pak
From Wikipedia, the free encyclopedia
Igor Pak (born 1971, Moscow, Russia) is an associate professor of mathematics at MIT, working in combinatorics and discrete probability. He is best known for his bijective proof of the hook-length formula for the number of Young tableaux, and his work on random walks. Pak has co-authored a paper on Markov chains with László Lovász, which gives him an Erdős number of 2. He was a keynote speaker alongside George Andrews and Doron Zeilberger at the 2006 Harvey Mudd College Mathematics Conference on Enumerative Combinatorics.
[edit] Background
Igor Pak went to Moscow High School № 57. After graduating, he worked for a year at Bank Menatep.
Pak did his undergraduate studies at Moscow State University. He was a Ph.D. student of Persi Diaconis at Harvard University. Afterwards, he worked with László Lovász as a postdoc at Yale University. He was a fellow at MSRI and a long term visitor at the Hebrew University of Jerusalem.
[edit] External links
- Personal site
- List of published papers, with abstracts
- MIT Mathematics Department website
- Igor Pak at the Mathematics Genealogy Project
 |
This article about a Russian mathematician is a stub. You can help Wikipedia by expanding it. |
Categories: 1971 births | Living people | 20th century mathematicians | 21st century mathematicians | Combinatorists | Erdős number 2 | American mathematicians | Russian mathematicians | Russian-Americans | People from Moscow | Alumni and faculty of Moscow State University | Harvard University alumni | Massachusetts Institute of Technology faculty | European mathematician stubs
