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

TL;DR
This paper derives an explicit formula for counting linear transformations with prescribed invariant factors from a subspace to a vector space over a finite field, extending previous results and applying to control theory and matrix enumeration.
Contribution
It provides the first explicit counting formula for linear transformations with given invariant factors from a subspace to a vector space, generalizing prior work for the case when the subspace equals the entire space.
Findings
Derived an explicit formula for the count of such transformations.
Extended the Gerstenhaber-Reiner formula for matrices with a given characteristic polynomial.
Provided new proofs for recent results in linear control theory.
Abstract
Given a finite-dimensional vector space over the finite field and a subspace of , we consider the problem of counting linear transformations which have prescribed invariant factors. The case is a well-studied problem that is essentially equivalent to counting the number of square matrices over in a conjugacy class and an explicit formula is known in this case. On the other hand, the case of general 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 are of degree zero. We extend this result to the case of arbitrary 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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
