BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CMSA - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:CMSA
X-ORIGINAL-URL:https://cmsa.fas.harvard.edu
X-WR-CALDESC:Events for CMSA
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230302T120000
DTEND;TZID=America/New_York:20230302T130000
DTSTAMP:20260513T231842
CREATED:20230817T165840Z
LAST-MODIFIED:20240118T052933Z
UID:10001235-1677758400-1677762000@cmsa.fas.harvard.edu
SUMMARY:New bounds on lattice covering volumes\, and nearly uniform covers
DESCRIPTION:Member Seminar \nSpeaker: Barak Weiss   \nTitle: New bounds on lattice covering volumes\, and nearly uniform covers \nAbstract: Let L be a lattice in R^n and let K be a convex body. The covering volume of L with respect to K is the minimal volume of a dilate rK\, such that L+rK = R^n\, normalized by the covolume of L. Pairs (L\,K) with small covering volume correspond to efficient coverings of space by translates of K\, where the translates lie in a lattice. Finding upper bounds on the covering volume as the dimension n grows is a well studied problem\, with connections to practical questions arising in computer science and electrical engineering. In a recent paper with Or Ordentlich (EE\, Hebrew University) and Oded Regev (CS\, NYU) we obtain substantial improvements to bounds of Rogers from the 1950s. In another recent paper\, we obtain bounds on the minimal volume of nearly uniform covers (to be defined in the talk). The key to these results are recent breakthroughs by Dvir and others regarding the discrete Kakeya problem. I will give an overview of the questions and results.
URL:https://cmsa.fas.harvard.edu/event/member-seminar-3223/
LOCATION:CMSA Room G10\, CMSA\, 20 Garden Street\, Cambridge\, MA\, 02138\, United States
CATEGORIES:Member Seminar
END:VEVENT
END:VCALENDAR