English

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

Probability 2018-08-27 v2 Combinatorics Representation Theory

Abstract

Consider the random walk on the n×nn \times n upper triangular matrices with ones on the diagonal and elements over Fp\mathbb{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 pp is p2p^2. This is proven by combining super-character theory and comparison theory arguments.

Keywords

Cite

@article{arxiv.1609.01238,
  title  = {Super-character theory and comparison arguments for a random walk on the upper triangular matrices},
  author = {Evita Nestoridi},
  journal= {arXiv preprint arXiv:1609.01238},
  year   = {2018}
}

Comments

15 pages

R2 v1 2026-06-22T15:40:21.327Z