The random walk on upper triangular matrices over $\mathbb{Z}/m \mathbb{Z}$

Abstract

We study a natural random walk on the n×n upper triangular matrices, with entries in Z/mZ, generated by steps which add or subtract a uniformly random row to the row above. We show that the mixing time of this random walk is O(m 2 n log n + n 2 m o(1)