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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.