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

The author looks at random walks on \(n\times n\) upper triangular matrices with ones on the diagonal and elements over \({\mathbb F}_p\), where one picks a row at random and either adds it or subtracts it from the row directly above it. By combining super-character theory and comparison theory arguments, she proves that the dependency of the associated mixing time on \(p\) is \(p^2\).