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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200120T163000
DTEND;TZID=Asia/Seoul:20200120T173000
DTSTAMP:20260420T150341
CREATED:20200108T022511Z
LAST-MODIFIED:20240705T202052Z
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.
URL:https://dimag.ibs.re.kr/event/2020-01-20/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR