BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//132.216.98.100//NONSGML kigkonsult.se iCalcreator 2.20.4//
BEGIN:VEVENT
UID:20260610T100345EDT-8841f4kdgJ@132.216.98.100
DTSTAMP:20260610T140345Z
DESCRIPTION:TITLE / TITRE\n\nPolynomial inequalities and combinatorial inte
 rpretations\n	\n	ABSTRACT / RÉSUMÉ \n\nIn combinatorics\, many inequalities 
 can be proved by an explicit injection. Such proofs can be both elegant an
 d insightful. As an application\, they give a combinatorial interpretation
  for the difference between two sides. But what happens to the inequalitie
 s 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 wi
 ll discuss how to prove negative results for algebraic inequalities and wh
 at does all of that mean. This is joint work with Christian Ikenmeyer.\n\n
 PLACE / LIEU /\n	Hybride - UQAM Salle / Room PK-5115\, Pavillon Président-K
 ennedy\n	\n	 \n
DTSTART:20240913T140000Z
DTEND:20240913T140000Z
SUMMARY:Igor Pak (UCLA) 
URL:https://www.mcgill.ca/mathstat/channels/event/igor-pak-ucla-359453
END:VEVENT
END:VCALENDAR