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:20221207T004000Z
UID:indico-event-4006@indico.math.cnrs.fr
DESCRIPTION:Speakers: Andrew Elvey Price\n\nIn "The Art of Computer Progra
mming"\, Knuth asked how many permutations of each length can be sorted by
each of the following machines: two stacks in parallel (2sip)\, two stack
s in series (2sis) and a double ended queue (deque). I will describe recen
t results of Albert\, Bousquet-MÃ©lou\, E. and Guttmann relating the gener
ating functions for 2sip-sortable permutations and deque-sortable permutat
ions to each other as well as a generating function for weighted quarter-p
lane loops. I will then describe numerical work of E. and Guttmann on the
problem of enumerating 2sis-sortable permutations.\n\nhttps://indico.math.
cnrs.fr/event/4006/
LOCATION:Salle E2 1180 (Tours)
URL:https://indico.math.cnrs.fr/event/4006/
END:VEVENT
END:VCALENDAR