BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:69cf7c8fb8613
DTSTART;TZID=America/Toronto:20241107T140000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20241107T150000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-stephan
SUMMARY:Algebraic and enumerative combinatorics seminar-Stephan\nPfannerer-
 Mittas
CLASS:PUBLIC
DESCRIPTION:TITLE:Descents for Border Strip Tableaux\n\nSpeaker\n Stephan P
 fannerer-Mittas\n\nAffiliation\n University of Waterloo\n\nLocation\n MC 5
 479\n\n ABSTRACT: Lusztig's fake degree is the generating polynomial for 
 the\nmajor index of standard Young tableaux of a given shape. Results of\n
 Springer and James & Kerber imply that\, mysteriously\, its evaluation\nat
  a d-th primitive root of unity yields the number of border strip\ntableau
 x with all strips of size d\, up to sign. This is essentially\nthe special
  case of the Murnaghan-Nakayama rule for rectangular\npartitions as cycle 
 type. We refine this result to standard Young\ntableaux and border strip t
 ableaux with a given number of descents. To\ndo so\, we introduce a new de
 scent statistic for border strip tableaux\,\nextending the classical defin
 ition for standard Young tableaux.\n\nTHERE WILL BE A PRE-SEMINAR PRESENTI
 NG RELEVANT BACKGROUND AT THE\nBEGINNING GRADUATE LEVEL STARTING AT 1PM\,
DTSTAMP:20260403T083839Z
END:VEVENT
END:VCALENDAR