Name Igor Pak | Role Professor of mathematics | |
 | ||
Education | ||
Igor pak words in linear groups random walks automata and p recursiveness
Igor Pak (Russian: Игорь Пак) (born 1971, Moscow, Soviet Union) is a professor of mathematics at the University of California, Los Angeles, working in combinatorics and discrete probability. He formerly taught at the Massachusetts Institute of Technology, and the University of Minnesota and is best known for his bijective proof of the hook-length formula for the number of Young tableaux, and his work on random walks. He was a keynote speaker alongside George Andrews and Doron Zeilberger at the 2006 Harvey Mudd College Mathematics Conference on Enumerative Combinatorics.
Contents
- Igor pak words in linear groups random walks automata and p recursiveness
- Igor Pak UCLA The combinatorics and complexity of integer sequences 2017
- Background
- References
Pak is an Associate Editor for the journal Discrete Mathematics and an Editor (responsible for combinatorics and discrete geometry) of the Transactions of the American Mathematical Society. He gave a Fejes Tóth Lecture at the University of Calgary in February 2009.
Igor Pak (UCLA) - The combinatorics and complexity of integer sequences [2017]
Background
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, where he received a PhD in Mathematics in 1997. Afterwards, he worked with László Lovász as a postdoc at Yale University. He was a fellow at the Mathematical Sciences Research Institute, and a long term visitor at the Hebrew University of Jerusalem.