Counting zero kernel pairs over a finite field

DOI10.1016/J.LAA.2016.01.029MaRDI QIDQ5962832zbMATH OpenOpenAlexFDO

Authors Samrith Ram

Publication date 24 February 2016

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

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

zbMATH Keywords

matrix completionfinite fieldobservable pairreachable pairunimodular matrix polynomialzero kernel pair

Mathematics Subject Classification ID

Matrix completion problems (15A83) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Attainable sets, reachability (93B03) Observability (93B07) Matrix pencils (15A22)

Abstract: Helmke et al. have recently given a formula for the number of reachable pairs of matrices over a finite field. We give a new and elementary proof of the same formula by solving the equivalent problem of determining the number of so called zero kernel pairs over a finite field. We show that the problem is equivalent to certain other enumeration problems and outline a connection with some recent results of Guo and Yang on the natural density of rectangular unimodular matrices over $Fq[x]$. We also propose a new conjecture on the density of unimodular matrix polynomials.

Recommendations

• Unimodular polynomial matrices over finite fields
• scientific article; zbMATH DE number 807867
• scientific article; zbMATH DE number 6683614
• Counting Matrices with Coordinates in Finite Fields and of Fixed Rank.
• Counting problems and ranks of matrices

Cites work

• scientific article; zbMATH DE number 3577263 (Why is no real title available?)
• scientific article; zbMATH DE number 481629 (Why is no real title available?)
• scientific article; zbMATH DE number 1182386 (Why is no real title available?)
• Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
• Matrix completion problems
• On the number of controllable linear systems over a finite field
• Partially specified matrices and operators: classification, completion, applications
• Reachability of random linear systems over finite fields
• The probability of rectangular unimodular matrices over \(\mathbb F_q[x]\)
• Topology of the moduli space for reachable linear dynamical systems: The complex case

Cited in

(4)

• Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields
• Enumerating partial linear transformations in a similarity class
• The number of linear transformations defined on a subspace with given invariant factors
• Unimodular polynomial matrices over finite fields

This page was built for publication: Counting zero kernel pairs over a finite field

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