BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//jEvents 2.0 for Joomla//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:STANDARD
DTSTART:20240219T104500
RDATE:20240310T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20241103T010000
RDATE:20250309T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20251102T010000
RDATE:20260308T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20261101T010000
RDATE:20270314T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20271107T010000
RDATE:20280312T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:STANDARD
DTSTART:20281105T010000
RDATE:20290311T030000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:America/New_York EST
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20240310T030000
RDATE:20241103T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20250309T030000
RDATE:20251102T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20260308T030000
RDATE:20261101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20270314T030000
RDATE:20271107T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
BEGIN:DAYLIGHT
DTSTART:20280312T030000
RDATE:20281105T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:America/New_York EDT
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:bcb75a4f8eaf45df0cf9b62b6ae63827
CATEGORIES:Symmetric Functions & Probability Theory Seminar
CREATED:20250210T110712
SUMMARY:Shuffling via transpositions
LOCATION:Hill 705
DESCRIPTION:Date: 02/19/2025Speaker: Evita Nestoridi (https://evitanestoridi.github.io/
 ) (Stony Brook)\nTitle: Shuffling via transpositions \nAbstract: In their s
 eminal work, Diaconis and Shahshahani proved that shuffling a deck of $n$ c
 ards sufficiently well via random transpositions takes $1/2 n log n$ steps.
  Their argument was algebraic and relied on the combinatorics of the symmet
 ric group. In this talk, I will focus on a generalization of random transpo
 sitions and I will discuss the underlying combinatorics for understanding t
 heir mixing behavior and indeed proving cutoff. The talk will be based on j
 oint work with S. Arfaee.\n
X-ALT-DESC;FMTTYPE=text/html:<div jscontroller="Ae65rd" jsaction="https://www.math.rutgers.edu/touchstar
 t:UrsOsc; click:KjsqPd; focusout:QZoaZ; mouseover:y0pDld; mouseout:dq0hvd;f
 v1Rjc:jbFSOd;CrfLRd:SzACGe;" style="display: inline-block; max-width: 100%;
  position: relative;"><span style="font-family: Lato, Arial; font-size: 11p
 t; font-variant: normal; font-weight: bold; vertical-align: baseline;">Date
 </span><span style="font-size: 11pt; font-variant: normal; vertical-align: 
 baseline;">: 02/19/2025</span></div><p dir="ltr" style="margin: 12px 0px 0p
 x; outline: none; position: relative; color: #212121; font-size: 11pt; font
 -style: normal; font-weight: 400; font-family: Lato, sans-serif; line-heigh
 t: 1.6667; letter-spacing: normal; orphans: 2; text-align: start; text-inde
 nt: 0px; text-transform: none; widows: 2; word-spacing: 0px; white-space: n
 ormal;"><span style="font-family: Lato, Arial; font-variant: normal; font-w
 eight: bold;">Speaker</span><span style="font-variant: normal;">:&nbsp;</sp
 an><a href="https://evitanestoridi.github.io/" target="_blank" rel="noopene
 r" style="color: inherit; text-decoration: none;"><span style="color: #0065
 80; font-variant: normal; text-decoration: underline;">Evita Nestoridi</spa
 n></a><span style="font-variant: normal;">&nbsp;(Stony Brook)</span></p><p 
 dir="ltr" style="margin: 12px 0px 0px; outline: none; position: relative; c
 olor: #212121; font-size: 11pt; font-style: normal; font-weight: 400; font-
 family: Lato, sans-serif; line-height: 1.6667; letter-spacing: normal; orph
 ans: 2; text-align: start; text-indent: 0px; text-transform: none; widows: 
 2; word-spacing: 0px; white-space: normal;"><span style="font-family: Lato,
  Arial; font-variant: normal; font-weight: bold;">Title</span><span style="
 font-variant: normal;">:&nbsp;</span>Shuffling via transpositions&nbsp;</p>
 <p dir="ltr" style="margin: 12px 0px 0px; outline: none; position: relative
 ; color: #212121; font-size: 11pt; font-style: normal; font-weight: 400; fo
 nt-family: Lato, sans-serif; line-height: 1.6667; padding-bottom: 0px; lett
 er-spacing: normal; orphans: 2; text-align: start; text-indent: 0px; text-t
 ransform: none; widows: 2; word-spacing: 0px; white-space: normal;"><span s
 tyle="font-family: Lato, Arial; font-variant: normal; font-weight: bold;">A
 bstract</span><span style="font-variant: normal;">:&nbsp;</span><span style
 ="color: #242424; font-family: Roboto, Arial; font-size: 11.5pt; font-weigh
 t: 400; vertical-align: baseline;">In their seminal work, Diaconis and Shah
 shahani proved that shuffling a deck of $n$ cards sufficiently well via ran
 dom transpositions takes $1/2 n log n$ steps. Their argument was algebraic 
 and relied on the combinatorics of the symmetric group. In this talk, I wil
 l focus on a generalization of random transpositions and I will discuss the
  underlying combinatorics for understanding their mixing behavior and indee
 d proving cutoff. The talk will be based on joint work with S. Arfaee.</spa
 n></p>
CONTACT:Evita Nestoridi
DTSTAMP:20260827T204539
DTSTART;TZID=America/New_York:20250219T104500
DTEND;TZID=America/New_York:20250219T234500
SEQUENCE:0
TRANSP:OPAQUE
END:VEVENT
END:VCALENDAR