Journal of Combinatorics
Volume 2 (2011)
Matrices with restricted entries and $q$-analogues of permutations
Pages: 355 – 395
We study the functions that count matrices of given rank over a finitefield with specified positions equal to zero. We show that thesematrices are $q$-analogues of permutations with certain restrictedvalues. We obtain a simple closed formula for the number of invertiblematrices with zero diagonal, a $q$-analogue of derangements, anda curious relationship between invertible skew-symmetric matricesand invertible symmetric matrices with zero diagonal. In addition,we provide recursions to enumerate matrices and symmetric matriceswith zero diagonal by rank, and we frame some of our resultsin the context of Lie theory. Finally, we provide a brief expositionof polynomiality results for enumeration questions related to thosementioned, and give several open questions.