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:20220101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20231212T163000
DTEND;TZID=Asia/Seoul:20231212T173000
DTSTAMP:20260416T182346
CREATED:20231019T075456Z
LAST-MODIFIED:20240707T072622Z
UID:7777-1702398600-1702402200@dimag.ibs.re.kr
SUMMARY:Ting-Wei Chao (趙庭偉)\, Tight Bound on Joints Problem and Partial Shadow Problem
DESCRIPTION:Given a set of lines in $\mathbb R^d$\, a joint is a point contained in d linearly independent lines. Guth and Katz showed that N lines can determine at most $O(N^{3/2})$ joints in $\mathbb R^3$ via the polynomial method. \nYu and I proved a tight bound on this problem\, which also solves a conjecture proposed by Bollobás and Eccles on the partial shadow problem. It is surprising to us that the only known proof of this purely extremal graph theoretic problem uses incidence geometry and the polynomial method.
URL:https://dimag.ibs.re.kr/event/2023-12-12/
LOCATION:Room B332\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR