Computer Science/Discrete Mathematics Seminar II

The product replacement algorithm is a commonly used algorithm to generate a random element in a finite group. While its performance is quite outstanding, its theretical understanding is quite poor. We will present a joint work with Igor Pak (JAMS 2001) which suggests a conceptual way to study this algorithm and gives some partial results. Some quetions and directions developed following that work will also be presented.