= Igor Pak
{c}
{wiki}
<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.https://www.math.ucla.edu/~pak/[Research statement and selected lectures]{ref} 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: https://www.math.ucla.edu/~pak/
\Image[https://ww3.math.ucla.edu/wp-content/uploads/2024/08/Igor-Pak.jpg]
{title=Igor Pak}
{description=Photograph identified on the https://ww3.math.ucla.edu/about/welcome-from-the-chair/[portrait record].}
{width=240}
Back to article page
