Super-character theory and comparison arguments for a random walk on the upper triangular matrices

摘要

Consider the random walk on the n x n upper triangular matrices with ones on the diagonal and elements over F-p where we pick a row at random and either add it or subtract it from the row directly above it. The main result of this paper is to prove that the dependency of the mixing time on p is p(2). This is proven by combining super-character theory and comparison theory arguments. Published by Elsevier Inc.