The number of linear transformations defined on a subspace with given invariant factors

Abstract

Given a finite-dimensional vector space V over the finite field Fq and a subspace W of V, we consider the problem of counting linear transformations T:W V which have prescribed invariant factors. The case W=V is a well-studied problem that is essentially equivalent to counting the number of square matrices over Fq in a conjugacy class and an explicit formula is known in this case. On the other hand, the case of general W is also an interesting problem and there hasn't been substantive progress in this case for over two decades, barring a special case where all the invariant factors of T are of degree zero. We extend this result to the case of arbitrary W by giving an explicit counting formula. As an application of our results, we give new proofs of some recent enumerative results in linear control theory and derive an extension of the Gerstenhaber-Reiner formula for the number of square matrices over Fq with given characteristic polynomial.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…