Igor Pak Home Page
I am a Professor at the Mathematics Department
at UCLA. Before coming here, I was teaching at
University of Minnesota and at
MIT.
Prior to that, I was a Gibbs Instructor at Yale University
and a Postdoctoral Fellow at MSRI.
I got my Ph.D. from Harvard University.
I did my undergraduate studies at Moscow
State University.
I work in Discrete Mathematics. More specifically, my research spans
the following topics:
 Discrete and Polyhedral Geometry,
 Enumerative and Algebraic Combinatorics,
 Probability and Computations on
Groups.
My undergraduate advisor was
Alexandre
Kirillov (currently at
UPenn). My graduate advisor was
Persi Diaconis (currently at
Stanford). As a postdoc at Yale,
I was working with
László Lovász
(currently at Eötvös Loránd
University in Budapest, Hungary).
As a NSF postdoc at MIT, I was working with
Richard Stanley (still at MIT).
Here are some of my papers. My Google Scholar profile.
Here is my book: Lectures on Discrete and Polyhedral Geometry.
Popular math writing links:
Teaching:
 Math 206A
(Enumerative Combinatorics, Fall 2019)
 Math 19
(Integer Sequences Seminar, Fall 2019)
 Math 206
(Combinatorics of the Symmetric Group, Winter 2019)
 Math 19
(Experimental Mathematics Seminar, Winter 2019)
 Math 206
(Geometric Combinatorics, Fall 2018)
 Math 285
(Combinatorics inspired by Number Theory, Spring 2018)
 Math 184
(Enumerative Combinatorics, Winter 2018)
 Math 61
(Introduction to Discrete Structures, Spring 2015)
 Math 184
(Enumerative Combinatorics, Winter 2017)
 Math 205
(Combinatorics of integer sequences) (Fall 2016)
 Math 180
(Graph Theory) (Spring 2014)

Math 184
(Enumerative Combinatorics, Winter 2016)
 Math 61
(Introduction to Discrete Structures, Spring 2015)

Math 206
(Combinatorics of words) (Fall 2014)

Math 180
(Combinatorics) (Spring 2014)

Math 206
(Combinatorial Theory, Winter 2014)

Math 206
(Combinatorial Theory, Fall 2013)

Math 115A (Spring 2013)

Math 285N
(Tilings) (Winter 2013)

Math 206
(Combinatorial Theory) (Fall 2012)

Math 180
(Combinatorics) (Spring 2012)

Math 285N
(Combinatorics, Probability and Computations on groups) (Winter 2011)

Math 285N (Enumerative Combinatorics) (Fall 2010)

Math 285N (Discrete Geometry) (Spring 2010)
For the old courses, see my Teaching Page.
Links to some lectures and lecture series:
 Complexity problems in enumerative combinatorics, ICM Rio de Janeiro (August 2018).
 The combinatorics and complexity of integer sequences, Banff workshop (September 2017).
 Computability and Enumeration, Mathematics of Jirka Matousek, Charles University, Prague (July 2016).
 Words in linear groups, random walks, automata and Precursiveness, Banff, Canada (March 2015).
 Counting with Wang tiles, IMA, Minneapolis (November 2014).
 Universality theorems in Algebra and Geometry, Stony Brook U. (September 2014)

New Foundations of Combinatorial Theory at SLC 73 (Austria, September 2014).
 Geometry of mechanisms: from trains to computers (NerdNite LA, March 2014).

Triangulations of Convex Polytopes (Russia, 2012).
 Quantitative Steinitz Problem (Russia, 2012).

Lectures on bijections (IPAM, UCLA, 2009).
 Caged
eggs and the rigidity of convex polyhedra (Oded Schramm Memorial Conference, Microsoft, 2009).
 Dyson's rank, crank and adjoint (supplemental material).

Ribbon Tile Invariants. The Prequel and the Sequel (MIT, 2000).

Probability and Computation on Groups (3 lectures in New York and MSRI, 19992000).
Resume:
I have a dated short (.pdf file, 1.2 pages)
and an extended (.pdf file, 31 pages)
versions of the resume.
I also have a list of my coauthors
with their web pages (if available).
Former Ph.D. students:
Postdocs:
Contact information:
Igor Pak
Department of Mathematics, UCLA
Los Angeles, CA 90095, USA
Office: Math Sciences 6125
Phone: (310) 8254701 (no message service)
Fax: (310) 2066673
Email: my last name AT math DOT my university.edu
Last updated: 9/28/2019