BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY: A proof of the shuffle conjecture
DTSTART:20151117T151500
DTEND:20151117T170000
DTSTAMP:20260510T235157Z
UID:bb16072c6bfbcb2c7ce5599bc7b7e7411f31e3096b8df2e6fd3ffa17
CATEGORIES:Conferences - Seminars
DESCRIPTION:Anton Mellit\, SISSA/ICTP\nThe shuffle conjecture gives a comb
 inatorial interpretation of certain generating functions arising from the 
 study of the action of the permutation group S_n on the algebra of polynom
 ials in 2n variables x_1\, y_1\,...\, x_n\, y_n. The combinatorial side is
  given in terms of certain objects called parking functions\, and the gene
 rating functions that arise there can be thought of as generalizations of 
 Catalan numbers. The conjecture was formulated by Haglund and his collabor
 ators in 2005\, and since then attracted a lot of interest of algebraic co
 mbinatorists. During Erik Carlsson's stay at ICTP last year we were able t
 o prove the conjecture\, and that's what the talk will be about. First 45 
 minutes are intended for a general audience\, I will talk about symmetric 
 functions and demonstrate some important general tools for dealing with th
 e generating functions of the kind we encountered. After a break I will co
 ntinue with more details on our proof.
LOCATION:CHB331 http://plan.epfl.ch/?zoom=20&recenter_y=5864117.69298&rece
 nter_x=731381.1146&layerNodes=fonds\,batiments\,labels\,information\,parki
 ngs_publics\,arrets_metro\,transports_publics&floor=3&q=CHB331
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR