Hyperplane Arrangements and Stopping Times

Evita Nestoridi, Stanford University
Fine Hall 214

Please note special day (Tuesday, November 10).    Consider a real hyperplane arrangement and let C denote the collection of the occuring chambers. Bidigare, Hanlon and Rockmore introduced a Markov chain on C which is a generalization of some card shuffling models used in computer science, biology and card games: the famous Tsetlin library used in dynamic file maintenance and cache maintenance and the riffle shuffles are two important examples of hyperplane walks. I introduce a strong stationary argument for this Markov chain, which provides explicit bounds for the separation distance. I will try to explain both the geometric and the probabilistic techniques used in the problem.