BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CERN//INDICO//EN
BEGIN:VEVENT
SUMMARY:Enumerating permutations sortable by two stacks in suits\, two sta
cks in parallel and a double ended queue
DTSTART;VALUE=DATE-TIME:20181019T083000Z
DTEND;VALUE=DATE-TIME:20181019T093000Z
DTSTAMP;VALUE=DATE-TIME:20220123T220119Z
UID:indico-event-4006@indico.math.cnrs.fr
DESCRIPTION:In "The Art of Computer Programming"\, Knuth asked how many pe
rmutations of each length can be sorted by each of the following machines:
two stacks in parallel (2sip)\, two stacks in series (2sis) and a double
ended queue (deque). I will describe recent results of Albert\, Bousquet-M
élou\, E. and Guttmann relating the generating functions for 2sip-sortabl
e permutations and deque-sortable permutations to each other as well as a
generating function for weighted quarter-plane loops. I will then describe
numerical work of E. and Guttmann on the problem of enumerating 2sis-sort
able permutations.\n\nhttps://indico.math.cnrs.fr/event/4006/
LOCATION:Tours Salle E2 1180
URL:https://indico.math.cnrs.fr/event/4006/
END:VEVENT
END:VCALENDAR