BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/521
DTSTAMP:20230914T125927Z
SUMMARY:On the Size of Kakeya Sets in Finite Fields
DESCRIPTION:Speaker: Amey Bhangale (Rutgers University\nDepartment of Compu
ter Science\n110 Frelinghuysen Road\nPiscataway\, NJ 08854-8019\nUnited St
ates of America)\n\nAbstract: \nAbstract: A Kakeya set is a subset of [ima
ge: F^n]\, where [image: F] is a finite field of [image: q] elements\, tha
t contains a line in every direction. What can we say about the size of th
is set? How large the size of the set must be?\n\nI will be discussing the
paper: On the size of Kakeya sets in finite fields by Zeev Dvir. In the p
aper\, a beautiful application of 'polynomial method' is used to give a lo
wer bound on the size of the Kakeya Set.\n
URL:https://www.tcs.tifr.res.in/web/events/521
DTSTART;TZID=Asia/Kolkata:20140801T143000
DTEND;TZID=Asia/Kolkata:20140801T160000
LOCATION:D-405 (D-Block Seminar Room)
END:VEVENT
END:VCALENDAR