BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv4.9.13//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
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20200101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200120T163000
DTEND;TZID=Asia/Seoul:20200120T173000
DTSTAMP:20200118T135514
CREATED:20200108T022511Z
LAST-MODIFIED:20200108T022511Z
UID:1997-1579537800-1579541400@dimag.ibs.re.kr
SUMMARY:Adam Zsolt Wagner\, The largest projective cube-free subsets of $Z_{2^n}$
DESCRIPTION:What is the largest subset of $Z_{2^n}$ that doesn’t contain a projective d-cube? In the Boolean lattice\, Sperner’s\, Erdos’s\, Kleitman’s and Samotij’s theorems state that families that do not contain many chains must have a very specific layered structure. We show that if instead of $Z_2^n$ we work in $Z_{2^n}$\, analogous statements hold if one replaces the word k-chain by projective cube of dimension $2^{k-1}$. The largest d-cube-free subset of $Z_{2^n}$\, if d is not a power of two\, exhibits a much more interesting behaviour. \nThis is joint work with Jason Long. \n
URL:https://dimag.ibs.re.kr/event/2020-01-20/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200128T163000
DTEND;TZID=Asia/Seoul:20200128T173000
DTSTAMP:20200118T135514
CREATED:20191216T045747Z
LAST-MODIFIED:20191216T050700Z
UID:1940-1580229000-1580232600@dimag.ibs.re.kr
SUMMARY:Dillon Mayhew\, Courcelle's Theorem for hypergraphs
DESCRIPTION:Courcelle’s Theorem is an influential meta-theorem published in 1990. It tells us that a property of graph can be tested in polynomial time\, as long as the property can expressed in the monadic second-order logic of graphs\, and as long as the input is restricted to a class of graphs with bounded tree-width. There are several properties that are NP-complete in general\, but which can be expressed in monadic logic (3-colourability\, Hamiltonicity…)\, so Courcelle’s Theorem implies that these difficult properties can be tested in polynomial time when the structural complexity of the input is limited. \nMatroids can be considered as a special class of hypergraphs. Any finite set of vectors over a field leads to a matroid\, and such a matroid is said to be representable over that field. Hlineny produced a matroid analogue of Courcelle’s Theorem for input classes with bounded branch-width that are representable over a finite field. \nWe have now identified the structural properties of hypergraph classes that allow a proof of Hliněný’s Theorem to go through. This means that we are able to extend his theorem to several other natural classes of matroids. \nThis talk will contain an introduction to matroids\, monadic logic\, and tree-automata. \nThis is joint work with Daryl Funk\, Mike Newman\, and Geoff Whittle. \n
URL:https://dimag.ibs.re.kr/event/2020-01-28/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200218T163000
DTEND;TZID=Asia/Seoul:20200218T173000
DTSTAMP:20200118T135514
CREATED:20200114T112946Z
LAST-MODIFIED:20200114T112946Z
UID:2039-1582043400-1582047000@dimag.ibs.re.kr
SUMMARY:Dong Yeap Kang (강동엽)\, T.B.A.
DESCRIPTION:
URL:https://dimag.ibs.re.kr/event/2020-02-18/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20200615
DTEND;VALUE=DATE:20200620
DTSTAMP:20200118T135514
CREATED:20190607T162650Z
LAST-MODIFIED:20190607T162650Z
UID:947-1592179200-1592611199@dimag.ibs.re.kr
SUMMARY:Seymour is Seventy
DESCRIPTION:A conference honouring the seventieth birthday of Paul Seymour \n\nTo be held in ENS de Lyon\, France\, June 15 – 19\, 2020 \nConference Website: https://dimag.ibs.re.kr/seymour70/ \nSponsors: \n\nIBS Discrete Mathematics Group.\nLIP\, ENS de Lyon\, France.\nDepartment of Mathematics\, Princeton University.\n\n\n
URL:https://dimag.ibs.re.kr/event/seymour-is-seventy/
LOCATION:ENS de Lyon\, Lyon\, France
CATEGORIES:Workshops and Conferences
END:VEVENT
BEGIN:VEVENT
DTSTART;VALUE=DATE:20200824
DTEND;VALUE=DATE:20200829
DTSTAMP:20200118T135514
CREATED:20191122T084127Z
LAST-MODIFIED:20191122T085152Z
UID:1878-1598227200-1598659199@dimag.ibs.re.kr
SUMMARY:2020 IBS workshop on Extremal and Probabilistic Combinatorics
DESCRIPTION:Date\nAugust 24\, 2020 – August 28\, 2020 \nArrival: August 23 Sunday. Departure: August 29\, Saturday \nVenue\nRoom B109\, Institute for Basic Science\, 55 Expo-ro\, Yuseong-gu\, Daejeon\, South Korea \nInvited Speakers\nTo be announced. \nAccommodation\nLotte City Hotel and Hotel ICC are within 700m. Invited speakers will be provided an accommodation at the near-by hotels. \nOrganizers\n\nMihyun Kang\, Graz University of Technology\, Austria.\nJaehoon Kim\, KAIST\, Korea.\nSang-il Oum\, IBS Discrete Mathematics Group\, Korea and KAIST\, Korea.\n\n
URL:https://dimag.ibs.re.kr/event/2020-ibs-workshop/
LOCATION:Room B109\, IBS
CATEGORIES:Workshops and Conferences
END:VEVENT
END:VCALENDAR