BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20230101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241022T163000
DTEND;TZID=Asia/Seoul:20241022T173000
DTSTAMP:20260415T200835
CREATED:20240905T081105Z
LAST-MODIFIED:20240913T030403Z
UID:9850-1729614600-1729618200@dimag.ibs.re.kr
SUMMARY:Colin Geniet\, Permutations\, patterns\, and twin-width
DESCRIPTION:This talk will first introduce combinatorics on permutations and patterns\, presenting the basic notions and some fundamental results: the Marcus-Tardos theorem which bounds the density of matrices avoiding a given pattern\, and the Guillemot-Marx algorithm for pattern detection using the notion now known as twin-width. \nI will then present a decomposition result: permutations avoiding a pattern factor into bounded products of separable permutations. This can be rephrased in terms of twin-width: permutation with bounded twin-width are build from a bounded product of permutations of twin-width 0. Comparable results on graph encodings follow from this factorisation. \nThis is joint work with Édouard Bonnet\, Romain Bourneuf\, and Stéphan Thomassé.
URL:https://dimag.ibs.re.kr/event/2024-10-22/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR