BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/87
DTSTAMP:20230914T125909Z
SUMMARY:Perturbed Identity Matrices have High Rank: Proof and some Applicat
 ions
DESCRIPTION:Speaker: Kishor Barman\nSchool of Technology and Computer Scien
 ce\nTata Institute of Fundamental Research\nHomi Bhabha Road\n\nAbstract: 
 \nWe will discuss a lower bound (due to Noga Alon) on the rank of any real
  matrix in which all the diagonal entries are significantly larger (in abs
 olute value) than all the other entries. The fact that such matrices have 
  high  rank\, has helped in proving various results in combinatorics. In t
 his talk\, we would see some applications to - Geometry (we would see that
  the bound obtained by the Johnson-Lindenstrauss lemma is almost tight)\, 
 and - Coding theory (we would see an upper bound on the size of an Epsilon
 -balanced code).\n\n(See  Perturbed identity matrices have high rank: proo
 f and application  by Noga Alon for more details).\n
URL:https://www.tcs.tifr.res.in/web/events/87
DTSTART;VALUE=DATE:20100514
LOCATION:A-212 (STCS Seminar Room)
END:VEVENT
END:VCALENDAR