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:20241105T163000
DTEND;TZID=Asia/Seoul:20241105T173000
DTSTAMP:20260501T232149
CREATED:20240718T042813Z
LAST-MODIFIED:20241022T011746Z
UID:9550-1730824200-1730827800@dimag.ibs.re.kr
SUMMARY:Michał Pilipczuk\, Monadic stability and monadic dependence
DESCRIPTION:We will give an overview of the recent attempts of building a structure theory for graphs centered around First-Order transductions: a notion of containment inspired by finite model theory. Particularly\, we will speak about the notions of monadic dependence and monadic stability\, their combinatorial characterizations\, and the developments on the algorithmic front.
URL:https://dimag.ibs.re.kr/event/2024-11-05/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241112T163000
DTEND;TZID=Asia/Seoul:20241112T173000
DTSTAMP:20260501T232149
CREATED:20240831T051640Z
LAST-MODIFIED:20240917T095446Z
UID:9815-1731429000-1731432600@dimag.ibs.re.kr
SUMMARY:Karim Adiprasito\, Ehrhart theory revisited: Algebraic aspects\, unimodality and more
DESCRIPTION:Ehrhart theory is the study of lattice polytopes\, specifically aimed at understanding how many lattice points are inside dilates of a given lattice polytope\, and the study has a wide range of connections ranging from coloring graphs to mirror symmetry and representation theory. Recently\, we introduced new algebraic tools to understand this theory\, and resolve some classical conjectures. I will explain the combinatorial underpinnings behind two of the key techniques: Parseval identities for semigroup algebras\, and the character algebra of a semigroup.
URL:https://dimag.ibs.re.kr/event/2024-11-12/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20241126T163000
DTEND;TZID=Asia/Seoul:20241126T173000
DTSTAMP:20260501T232149
CREATED:20241018T131301Z
LAST-MODIFIED:20241018T132054Z
UID:9992-1732638600-1732642200@dimag.ibs.re.kr
SUMMARY:Eng Keat Hng\, Graphon branching processes and fractional isomorphism
DESCRIPTION:In 2005\, Bollobás\, Janson and Riordan introduced and extensively studied a general model of inhomogeneous random graphs parametrised by graphons. In particular\, they studied the emergence of a giant component in these inhomogeneous random graphs by relating them to a broad collection of inhomogeneous Galton-Watson branching processes. \nFractional isomorphism of finite graphs is an important and well-studied concept at the intersection of graph theory and combinatorial optimisation. It has many different characterizations that involve a range of very different and seemingly unrelated properties of graphs. Recently\, Grebík and Rocha developed a theory of fractional isomorphism for graphons. \nIn our work\, we characterise inhomogeneous random graphs that yield the same inhomogeneous Galton-Watson branching process (and hence have a similar component structure). \nThis is joint work with Jan Hladký and Anna Margarethe Limbach.
URL:https://dimag.ibs.re.kr/event/2024-11-26/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR