Abstract
Consider the random walk on the n×n upper triangular matrices with ones on the diagonal and elements over Fp 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 p2. This is proven by combining super-character theory and comparison theory arguments.
Original language | English (US) |
---|---|
Pages (from-to) | 97-113 |
Number of pages | 17 |
Journal | Journal of Algebra |
Volume | 521 |
DOIs | |
State | Published - Mar 1 2019 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
Keywords
- Comparison theory
- Mixing time
- Random walks on groups
- Super-character theory
- Super-classes
- Upper triangular matrices