BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:The Helly theorem for Hamming balls and related problems
DTSTART:20251128T142000
DTEND:20251128T152000
DTSTAMP:20260916T044056Z
UID:baa17cf8be3164df5bdc99e43cc4eb3314fa91cbdf54fc4ef5488e4c
CATEGORIES:Conferences - Seminars
DESCRIPTION:Benny Sudakov (ETH Zurich)\nHelly's theorem\, proved more than
  a century ago\, is a fundamental result in discrete geometry. It states t
 hat if every d+1 sets in a finite family of convex sets in d-dimensional E
 uclidean space has a nonempty intersection\, then the entire family has a 
 nonempty intersection.\n\nIn this talk\, we present a version of Helly's t
 heorem for Hamming balls with bounded radius. Our proof is based on a nove
 l variant of the so-called dimension argument\, which enables us to establ
 ish upper bounds that are independent of the dimension of the ambient spac
 e. We also discuss several connections between our result and problems in 
 extremal set theory\, coding theory\, and graph theory.\n\nJoint work with
  Noga Alon and Zhihan Jin.
LOCATION:GA 3 21 https://plan.epfl.ch/?room==GA%203%2021
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR