BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.17.2//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:20250101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20260818T163000
DTEND;TZID=Asia/Seoul:20260818T173000
DTSTAMP:20260730T134943Z
CREATED:20260326T020259Z
LAST-MODIFIED:20260730T134943Z
UID:12486-1787070600-1787074200@dimag.ibs.re.kr
SUMMARY:Jinyoung Park (박진영)\, A reformulation of Talagrand's Discrete Convexity Conjecture
DESCRIPTION:The “Convexity Conjecture” by Talagrand asks\, roughly speaking\, whether one can “create convexity” in a bounded number of steps regardless of the dimension of the ambient space. Talagrand also proposed a discrete version of this conjecture\, calling it his “lifetime favorite problem” and offering a $1\,000 prize for its solution. While the continuous version of the conjecture was recently proven by Hua\, Song\, and Tudose\, the discrete analogue remains wide open. In this talk\, we introduce a reformulation of the discrete convexity conjecture using the new notion of “k-thresholds\,” an extension of the traditional definition of thresholds. Using this framework\, we establish the conjecture for several special cases\, focusing primarily on graph properties.
URL:https://dimag.ibs.re.kr/event/2026-08-18/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR