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:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20250428T110000
DTEND;TZID=Asia/Seoul:20250428T120000
DTSTAMP:20260417T000412
CREATED:20250417T134915Z
LAST-MODIFIED:20250418T012250Z
UID:10801-1745838000-1745841600@dimag.ibs.re.kr
SUMMARY:Pascal Schweitzer\, Recent insights surrounding combinatorial approaches to isomorphism and symmetry problems
DESCRIPTION:Modern practical software libraries that are designed for isomorphism tests and symmetry computation rely on combinatorial techniques combined with techniques from algorithmic group theory. The Weisfeiler-Leman algorithm is such a combinatorial technique. When taking a certain view from descriptive complexity theory\, the algorithm is universal. After an introduction to problems arising in symmetry computation and this particular combinatorial technique\, I will give an overview of results from recent years. The results give insights into worst-case behavior and computational complexity.
URL:https://dimag.ibs.re.kr/event/2025-04-28/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR