Igor Pak (UCLA)

TITLE / TITRE

Polynomial inequalities and combinatorial interpretations

ABSTRACT / RÉSUMÉ 

In combinatorics, many inequalities can be proved by an explicit injection. Such proofs can be both elegant and insightful. As an application, they give a combinatorial interpretation for the difference between two sides. But what happens to the inequalities when this naive approach doesn't work? Can you actually prove that this approach is impossible? In the first half of the talk I will give a broad overview or what's known and give many examples. In the second half, I will discuss how to prove negative results for algebraic inequalities and what does all of that mean. This is joint work with Christian Ikenmeyer.

PLACE / LIEU /
Hybride - UQAM Salle / Room PK-5115, Pavillon Président-Kennedy