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

DOI10.1016/j.laa.2017.06.034zbMath1369.05008arXiv1603.06527OpenAlexW2963634707MaRDI QIDQ2401285

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

invariant factorsreachable pairzero kernel pairrectangular matrix polynomialGerstenhaber-Reiner formulamatrix conjugacy

Mathematics Subject Classification ID

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

Related Items

Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields ⋮ Enumerating partial linear transformations in a similarity class

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The probability that a matrix be nilpotent
• On the number of matrices with given characteristic polynomial
• On the number of nilpotent matrices with coefficients in a finite field
• Matrix completion problems
• On the number of controllable linear systems over a finite field
• The cycle structure of a linear transformation over a finite field
• Similarity of non-everywhere defined linear maps
• Some asymptotic results on finite vector spaces
• Partially specified matrices and operators: classification, completion, applications
• Obituary: Philip Hall
• Reachability of Random Linear Systems over Finite Fields
• Convolutional codes I: Algebraic structure
• Quantum calculus
• Counting zero kernel pairs over a finite field

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