BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Ila Varma
DTSTART:20260930T123000Z
DTEND:20260930T133000Z
DTSTAMP:20261022T151136Z
UID:IpmMathColloquium/1
DESCRIPTION:Title: Counting number fields and predicting asymptotics\nby
Ila Varma as part of IPM Mathematics Colloquium\n\nAbstract: TBA\n
LOCATION:https://master.researchseminars.org/talk/IpmMathColloquium/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Shayan Oveis Gharan (Professor of Computer Science & Engineering)
DTSTART:20261028T140000Z
DTEND:20261028T150000Z
DTSTAMP:20261022T151136Z
UID:IpmMathColloquium/2
DESCRIPTION:Title: High Dimensional Expanders and Separated Sets\nby Sha
yan Oveis Gharan (Professor of Computer Science & Engineering) as part of
IPM Mathematics Colloquium\n\n\nAbstract\nAbstract: Given a set of unit ve
ctors v1\,...\,vn (on a d-dimensional sphere). If they are pairwise orthog
onal then we can cluster them (into n clusters) such that the distance bet
ween any two clusters is at least say 1. Now\, suppose we have a weaker as
sumption that the average absolute value of the inner product || (
for i\,j chosen uniformly at random) is 1/n^0.99. Can we still find (at le
ast) 2 clusters (of linear size) with constant distance?\nThe problem is c
losely related to analysis of random walks and approximation algorithms fo
r the sparsest cut problem. I will show that contrary to our belief the an
swer is no. The proof is based on the rapidly evolving area theory of high
dimensional expanders.\nBased on a joint work with Farzam Ebrahimnejad.\n
\nJoin Zoom Meeting:\n\nhttps://us06web.zoom.us/j/86258815402?pwd=6vkzDDvv
k49gp5uJO4358acnj4k8Yb.1\n\nor \n\nhttps://zoom.us/join\n\nMeeting ID: 862
5881 5402\nPasscode: 260930\n
LOCATION:https://master.researchseminars.org/talk/IpmMathColloquium/2/
END:VEVENT
END:VCALENDAR