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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20230222T170000
DTEND;TZID=Asia/Seoul:20230222T180000
DTSTAMP:20260418T181117
CREATED:20221115T011207Z
LAST-MODIFIED:20240707T074027Z
UID:6483-1677085200-1677088800@dimag.ibs.re.kr
SUMMARY:Daniel Altman\, On an arithmetic Sidorenko conjecture\, and a question of Alon
DESCRIPTION:Let $G=\mathbb{F}_p^n$. Which systems of linear equations $\Psi$ have the property that amongst all subsets of $G$ of fixed density\, random subsets minimise the number of solutions to $\Psi$? This is an arithmetic analogue of a well-known conjecture of Sidorenko in graph theory\, which has remained open and of great interest since the 1980s. We will discuss some recent results along these lines\, with particular focus on some of the ideas behind a negative answer to a related question of Alon.
URL:https://dimag.ibs.re.kr/event/2023-02-22/
LOCATION:Zoom ID: 224 221 2686 (ibsecopro)
CATEGORIES:Virtual Discrete Math Colloquium
END:VEVENT
END:VCALENDAR