A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
Efficient methods for computing with matrices over finite fields often involverandomisedalgorithms, where matrices with a certain property are sought via repeated random selection. Complexity analyses for such algorithms require knowledge of the proportion of relevant matrices in the ambient group or algebra. We introduce a method for estimating proportions of families$N$of elements in the algebra of all$d\times d$matrices over a field of order$q$, where membership of a matrix in$N$depends onlydoi:10.1112/s146115701500008x fatcat:qqdh72vt4jd2zkm2scjyl5v7g4