BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//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:20220411T163000
DTEND;TZID=Asia/Seoul:20220411T173000
DTSTAMP:20260423T205349
CREATED:20220401T073000Z
LAST-MODIFIED:20240707T080114Z
UID:5326-1649694600-1649698200@dimag.ibs.re.kr
SUMMARY:Younjin Kim (김연진)\, On the extremal problems related to Szemerédi's theorem
DESCRIPTION:In 1975\, Szemerédi proved that for every real number $\delta > 0 $ and every positive integer $k$\, there exists a positive integer $N$ such that every subset $A$ of the set $\{1\, 2\, \cdots\, N \}$ with $|A| \geq \delta N$ contains an arithmetic progression of length $k$. There has been a plethora of research related to Szemerédi’s theorem in many areas of mathematics. In 1990\, Cameron and Erdős proposed a conjecture about counting the number of subsets of the set $\{1\,2\, \dots\, N\}$ which do not contain an arithmetic progression of length $k$. In the talk\, we study a natural higher dimensional version of this conjecture\, and also introduce recent extremal problems related to Szemerédi’s theorem.
URL:https://dimag.ibs.re.kr/event/2022-04-11/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR