BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Imre Bárány (Rényi Institute and University College London)
DTSTART:20220929T223000Z
DTEND:20220929T233000Z
DTSTAMP:20260421T235656Z
UID:SFUOR/3
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/SFUOR/3/">Ce
 lls in the Box and a Hyperplane</a>\nby Imre Bárány (Rényi Institute an
 d University College London) as part of PIMS-CORDS SFU Operations Research
  Seminar\n\nLecture held in ASB 10908.\n\nAbstract\nIt is well known that 
 a line can intersect at most $2n-1$ cells of the $n \\times n$ chessboard.
  What happens in higher dimensions: how many cells of the $d$-dimensional 
 $[0\,n]^d$ box can a hyperplane intersect? We also prove the integer analo
 gue of the following fact. If $K\, L$ are convex bodies in $R^d$ and $K \\
 subset L$\, then the surface area $K$ is smaller than that of $L$. Joint w
 ork with Peter Frankl.\n
LOCATION:https://researchseminars.org/talk/SFUOR/3/
END:VEVENT
END:VCALENDAR