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:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200825T163000
DTEND;TZID=Asia/Seoul:20200825T173000
DTSTAMP:20260420T001155
CREATED:20200816T234618Z
LAST-MODIFIED:20240707T082841Z
UID:2794-1598373000-1598376600@dimag.ibs.re.kr
SUMMARY:Ben Lund\, Point-plane incidence bounds
DESCRIPTION:In the early 1980s\, Beck proved that\, if P is a set of n points in the real plane\, and no more than g points of P lie on any single line\, then there are $\Omega(n(n-g))$ lines that each contain at least 2 points of P. In 2016\, I found a generalization of this theorem\, giving a similar lower bound on the number of planes spanned by a set of points in real space. I will discuss this result\, along with a number of applications and related open problems.
URL:https://dimag.ibs.re.kr/event/2020-08-25/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR