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:20210314T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20201101T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6833d33f90a15
DTSTART;TZID=America/Toronto:20210930T130000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20210930T130000
URL:/combinatorics-and-optimization/events/algebraic-co
 mbinatorics-seminar-john-noel
SUMMARY:Algebraic Combinatorics Seminar - John Noel
CLASS:PUBLIC
DESCRIPTION:Summary \n\nTITLE: Forcing Quasirandomness in Permutations\n\n
 Speaker:\n John Noel\n\nAffiliation:\n University of Victoria\n\nZoom:\n C
 ontact Steve Melczer\n\nABSTRACT:\n\nA striking result in graph theory is 
 that the property of a graph\nbeing quasirandom (i.e. resembling a random 
 graph) is characterized by\nthe number of edges and the number of 4-cycles
  being close to the\nexpected number in a random graph. Král’ and Pikhu
 rko (2013) proved\nan analogous result for permutations\; i.e. that quasir
 andom\npermutations are characterized by the densities of all permutations
  of\nlength 4.\n 
DTSTAMP:20250526T023439Z
END:VEVENT
END:VCALENDAR