Joint IAS/PU Groups and Dynamics Seminar

A similarity is a map from $R^d$ to itself that uniformly scales distances. When one repeatedly applies randomly chosen contracting similarities, the resulting Markov chain converges to a limiting stationary distribution known as a self-similar...

Let $n>2$. Weigold conjectured that if $G$ is a finite simple group then the product replacement graph on $n$-generating tuples is connected (which also implies that it is an expander for $n>3$). This conjecture is still (wide) open. I will discuss...