BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Christian Bean (Reykjavik University)
DTSTART:20210513T170000Z
DTEND:20210513T180000Z
DTSTAMP:20260423T021441Z
UID:combisem/35
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/combisem/35/
 ">Automating the enumeration of pattern-avoiding permutations</a>\nby Chri
 stian Bean (Reykjavik University) as part of Algebraic and enumerative com
 binatorics seminar\n\n\nAbstract\nWhen a combinatorial specification is kn
 own for a combinatorial class there are well-established tools\, such as s
 ymbolic and analytic combinatorics\, that derive an enumeration\, asymptot
 ics\, and the ability to randomly generate instances of the objects. Howev
 er\, the initial step from definition to structural description is often a
 d-hoc. This is the gap combinatorial exploration attempts to fill.\n\nIn t
 his seminar\, we will focus on the TileScope algorithm\, an application of
  combinatorial exploration to permutation classes. It is capable of findin
 g a combinatorial specification for almost every permutation class that av
 oids some subset of length 4 patterns\, and many more. The enumerations of
  these classes were either unknown or were the main results of research pa
 pers\, some as recent as 2018. We will discuss the strategies required for
  these specifications.\n\nEmail organizer for Zoom link\n
LOCATION:https://researchseminars.org/talk/combisem/35/
END:VEVENT
END:VCALENDAR