BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Daniel Tamayo (Université Paris-Saclay)
DTSTART:20210308T200000Z
DTEND:20210308T210000Z
DTSTAMP:20260423T024546Z
UID:YUAAS/25
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/YUAAS/25/">P
 ermutree Sorting\, Lattice Quotients\, and Automata</a>\nby Daniel Tamayo 
 (Université Paris-Saclay) as part of York University Applied Algebra Semi
 nar\n\n\nAbstract\nWe define permutree sorting which generalizes Knuth's s
 tack sorting and Reading's Coxeter sorting algorithms. (U\,D)-permutree so
 rting consists of an algorithm that succeeds or fails for a permutation de
 pending if it contains or avoids certain patterns determined by the sets U
  and D. We present this algorithm through a family of automata that read r
 educed words and show that the accepted reduced words form a search-tree s
 tructure related to lattice quotients of the weak order. This is joint wor
 k with Vincent Pilaud and Viviane Pons.\n
LOCATION:https://researchseminars.org/talk/YUAAS/25/
END:VEVENT
END:VCALENDAR