BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Hyperplane arrangements and Stopping times - Evita Nestoridi (Stan
 ford)
DTSTART:20151020T140000Z
DTEND:20151020T150000Z
UID:TALK60692@talks.cam.ac.uk
CONTACT:Perla Sousi
DESCRIPTION:Consider a real hyperplane arrangement and let C denote the co
 llection of the occuring chambers. Bidigare\, Hanlon and Rockmore introduc
 ed a Markov chain on C which is a generalization of some card shuffling mo
 dels used in computer science\, biology and card games: the famous Tsetlin
  library used in dynamic file maintenance and cache maintenance and the ri
 ffle shuffles are two important examples of hyperplane walks. I introduce 
 a strong stationary argument for this Markov chain\, which provides explic
 it bounds for the separation distance. I will try to explain both the geom
 etric and the probabilistic techniques used in the problem.
LOCATION:MR12\, CMS\, Wilberforce Road\, Cambridge\, CB3 0WB
END:VEVENT
END:VCALENDAR