  Connections between longest increasing subsequences in random permutations
and eigenvalues of random matrices with complex entries have been intensely
studied. This note applies properties of random elements of the finite general
linear group to obtain results about the longest increasing subsequence in non-
uniform random permutations.
