Some enumeration problems for matrices over a finite field

DOI10.1016/0024-3795(87)90093-0MaRDI QIDQ1090679zbMATH OpenOpenAlexFDO

Authors Amos Kovacs

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0024-3795(87)90093-0

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Matrices over special rings (quaternions, finite fields, etc.) (15B33)

Review text

The authors investigate when the product of m square matrices of size n over a finite field is (a) nilpotent (b) idempotent.

Cites work

• scientific article; zbMATH DE number 3821741 (Why is no real title available?)
• On the probability that the product of k n n matrices over a finite field will be zero
• The probability that a matrix be nilpotent

Cited in

(5)

• \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
• Enumerating traceless matrices over compact discrete valuation rings
• Random chain complexes
• scientific article; zbMATH DE number 6843241 (Why is no real title available?)
• A generating function approach to the enumeration of matrices in classical groups over finite fields

This page was built for publication: Some enumeration problems for matrices over a finite field

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