permutation matrix is chosen at random, each of its n
will lie somewhere on the unit circle. We investigate the average number of these that fall
in an interval that shrinks as the size of the matrix increases, and compare the results
against the case where n
points are chosen independently.