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

DOI10.1016/J.LAA.2017.06.034MaRDI QIDQ2401285zbMATH OpenOpenAlexFDO

Authors Samrith Ram

Publication date 8 September 2017

Published in Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.06527

zbMATH Keywords

Gerstenhaber-Reiner formulainvariant factorsmatrix conjugacyreachable pairrectangular matrix polynomialzero kernel pair

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Linear transformations, semilinear transformations (15A04) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Abstract: Given a finite-dimensional vector space $V$ over the finite field $mathbb{F}_q$ and a subspace $W$ of $V$, we consider the problem of counting linear transformations $T:WoV$ 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 $mathbb{F}_q$ 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 $mathbb{F}_q$ with given characteristic polynomial.

Recommendations

• Enumerating partial linear transformations in a similarity class
• The number of invariant subspaces under a linear operator on finite vector spaces
• Enumerating invariant subspaces of \(\mathbb R^{n}\)
• Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
• Similarity classes of linear transformations

Cites work

• Convolutional codes I: Algebraic structure
• Counting zero kernel pairs over a finite field
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 1182386 (Why is no real title available?)
• scientific article; zbMATH DE number 3336831 (Why is no real title available?)
• Matrix completion problems
• Obituary: Philip Hall
• On the number of controllable linear systems over a finite field
• On the number of matrices with given characteristic polynomial
• On the number of nilpotent matrices with coefficients in a finite field
• Partially specified matrices and operators: classification, completion, applications
• Quantum calculus
• Reachability of random linear systems over finite fields
• Similarity of non-everywhere defined linear maps
• Some asymptotic results on finite vector spaces
• The cycle structure of a linear transformation over a finite field
• The probability that a matrix be nilpotent

Cited in

(4)

• Enumerating partial linear transformations in a similarity class
• Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
• The number of invariant subspaces under a linear operator on finite vector spaces
• Similarity classes of linear transformations

This page was built for publication: The number of linear transformations defined on a subspace with given invariant factors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2401285)