Random walk on upper triangular matrices mixes rapidly

We present an upper bound O(n(2)) for the mixing time of a simple random wa lk on upper triangular matrices. We show that this bound is sharp up to a c onstant, and find tight bounds on the eigenvalue gap. We conclude by applyi ng our results to indicate that the asymmetric exclusion process on a circl e indeed mixes more rapidly than the corresponding symmetric process.