BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Torsten Mütze (University of Warwick)
DTSTART:20210426T140000Z
DTEND:20210426T150000Z
DTSTAMP:20260423T035533Z
UID:EPC/54
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/EPC/54/">Com
 binatorial generation via permutation languages</a>\nby Torsten Mütze (Un
 iversity of Warwick) as part of Extremal and probabilistic combinatorics w
 ebinar\n\n\nAbstract\nIn this talk I present a general and versatile algor
 ithmic framework for exhaustively generating a large variety of different 
 combinatorial objects\, based on encoding them as permutations\, which pro
 vides a unified view on many known results and allows us to prove many new
  ones. This talk gives an overview over three main applications of our fra
 mework: (1) the generation of pattern-avoiding permutations\; (2) the gene
 ration of various classes of rectangulations\; (3) the generation of latti
 ce congruences of the weak order on the symmetric group and of graph assoc
 iahedra.\n\nThis talk is based on joint work with Liz Hartung\, Hung P. Ho
 ang\, and Aaron Williams (SODA 2020)\, and with Arturo Merino (SoCG 2021) 
 and Jean Cardinal.\n
LOCATION:https://researchseminars.org/talk/EPC/54/
END:VEVENT
END:VCALENDAR