BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.16.5//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
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:20210101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220502T163000
DTEND;TZID=Asia/Seoul:20220502T173000
DTSTAMP:20240707T080029Z
CREATED:20220502T073000Z
LAST-MODIFIED:20240707T080029Z
UID:5511-1651509000-1651512600@dimag.ibs.re.kr
SUMMARY:Cheolwon Heo (허철원)\, The complexity of the matroid-homomorphism problems
DESCRIPTION:In this talk\, we introduce homomorphisms between binary matroids that generalize graph homomorphisms. For a binary matroid $N$\, we prove a complexity dichotomy for the problem $\rm{Hom}_\mathbb{M}(N)$ of deciding if a binary matroid $M$ admits a homomorphism to $N$. The problem is polynomial-time solvable if $N$ has a loop or has no circuits of odd length\, and is otherwise $\rm{NP}$-complete. We also get dichotomies for the list\, extension\, and retraction versions of the problem.\nThis is joint work with Hyobin Kim and Mark Siggers at Kyungpook National University.
URL:https://dimag.ibs.re.kr/event/2022-05-02/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220509T163000
DTEND;TZID=Asia/Seoul:20220509T173000
DTSTAMP:20240705T173026Z
CREATED:20220509T073000Z
LAST-MODIFIED:20240705T173026Z
UID:5524-1652113800-1652117400@dimag.ibs.re.kr
SUMMARY:Kyeongsik Nam (남경식)\, Large deviations for subgraph counts in random graphs
DESCRIPTION:The upper tail problem for subgraph counts in the Erdos-Renyi graph\, introduced by Janson-Ruciński\, has attracted a lot of attention. There is a class of Gibbs measures associated with subgraph counts\, called exponential random graph model (ERGM). Despite its importance\, lots of fundamental questions have remained unanswered owing to the lack of exact solvability. In this talk\, I will talk about a brief overview on the upper tail problem and the concentration of measure results for the ERGM. Joint work with Shirshendu Ganguly and Ella Hiesmayr.
URL:https://dimag.ibs.re.kr/event/2022-05-09/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20220530T163000
DTEND;TZID=Asia/Seoul:20220530T173000
DTSTAMP:20240705T172232Z
CREATED:20220530T073000Z
LAST-MODIFIED:20240705T172232Z
UID:5495-1653928200-1653931800@dimag.ibs.re.kr
SUMMARY:Hongseok Yang (양홍석)\, Learning Symmetric Rules with SATNet
DESCRIPTION:SATNet is a differentiable constraint solver with a custom backpropagation algorithm\, which can be used as a layer in a deep-learning system. It is a promising proposal for bridging deep learning and logical reasoning. In fact\, SATNet has been successfully applied to learn\, among others\, the rules of a complex logical puzzle\, such as Sudoku\, just from input and output pairs where inputs are given as images. In this paper\, we show how to improve the learning of SATNet by exploiting symmetries in the target rules of a given but unknown logical puzzle or more generally a logical formula. We present SymSATNet\, a variant of SATNet that translates the given symmetries of the target rules to a condition on the parameters of SATNet and requires that the parameters should have a particular parametric form that guarantees the condition. The requirement dramatically reduces the number of parameters to learn for the rules with enough symmetries\, and makes the parameter learning of SymSATNet much easier than that of SATNet. We also describe a technique for automatically discovering symmetries of the target rules from examples. Our experiments with Sudoku and Rubik’s cube show the substantial improvement of SymSATNet over the baseline SATNet. \nThis is joint work with Sangho Lim and Eungyeol Oh.
URL:https://dimag.ibs.re.kr/event/2022-05-30/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR