Igor Pak works in discrete mathematics, including enumerative combinatorics, algebraic combinatorics, polyhedral geometry, and probability and computation on groups. His research page presents these as interconnected subjects and lists lectures on convex polytopes and combinatorial inequalities.[ref]
https://www.math.ucla.edu/~pak/. Research statement and selected lectures
A common theme is to explain a numerical counting identity through the structure of the objects being counted, such as a bijection, rather than relying only on algebraic manipulation. Polyhedral methods add geometric constraints to those discrete enumeration questions.Homepage: www.math.ucla.edu/~pak/
Articles by others on the same topic
Igor Pak is a mathematician and professor known for his work in various fields, including combinatorics, mathematical biology, and mathematical education. He is associated with the University of California, Los Angeles (UCLA) and has made contributions to mathematical research and teaching. In addition to his academic work, Pak is known for creating engaging resources for mathematics education and promoting problem-solving skills among students.