BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.17.1//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:20260721T163000
DTEND;TZID=Asia/Seoul:20260721T173000
DTSTAMP:20260713T060115Z
CREATED:20260711T143148Z
LAST-MODIFIED:20260713T060115Z
UID:12865-1784651400-1784655000@dimag.ibs.re.kr
SUMMARY:Zichao Dong\, $k$-wise odd-even towns
DESCRIPTION:For $\boldsymbol{\alpha} = (\alpha_1\, \dots\, \alpha_k) \in {\mathbb F}_2^k$\, an $\boldsymbol{\alpha} $-town is a set family in which every $i$-wise intersection has parity $\alpha_i$. Denote by $f_{\boldsymbol{\alpha} }(n)$ the maximum size of an $\boldsymbol{\alpha} $-town on $[n]$. The classical oddtown and eventown problems study the cases $\boldsymbol{\alpha} = (1\, 0)$ and $(0\, 0)$\, respectively. We determine the sharp asymptotics of $f_{\boldsymbol{\alpha} }(n)$ for all $\boldsymbol{\alpha} $\, answering questions of Johnston-O’Neill and Wei-Zhang-Ge.
URL:https://dimag.ibs.re.kr/event/2026-07-21/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR