BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.16.3//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260616T163000
DTEND;TZID=Asia/Seoul:20260616T173000
DTSTAMP:20260610T174610
CREATED:20260602T121956Z
LAST-MODIFIED:20260602T121956Z
UID:12717-1781627400-1781631000@dimag.ibs.re.kr
SUMMARY:Harry Richman\, Distinguishing graphs with tropical Weierstrass weights
DESCRIPTION:I will introduce a new structure on finite graphs\, which takes the form of a labeling of the vertices by nonnegative integers (possibly repeated). This labeling is isomorphism invariant\, and seems to reflect some mix of local and global structure of the graph. I will describe an algorithm for computing these labels\, which uses a form of breadth-first search\, and some results on the resulting labels. This construction comes from a tropical analogue of Weierstrass weights on algebraic curves\, studied in the 1800s. Finally\, I will discuss some speculation on whether this may or may not be helpful for the graph isomorphism problem. \nThis is a joint work with Omid Amini and Lucas Gierczak.
URL:https://dimag.ibs.re.kr/event/2026-06-16/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR