Random walk on the symplectic forms over a finite field
Jimmy He
Source abstract
Random transvections generate a walk on the space of symplectic forms on F q 2 n . The main result is to establish cutoff for this Markov chain. After n + c steps, the walk is close to uniform while before n - c steps, it is far from uniform. The upper bound is proved by explicitly finding and bounding the eigenvalues of the random walk. The lower bound is found by showing that the support of the walk is exponentially small if only n - c steps are taken. The result can be viewed as a q -deformation of a result of Diaconis and Holmes on a random walk on matchings.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.