Counting zero kernel pairs over a finite field
From MaRDI portal
Publication:5962832
DOI10.1016/j.laa.2016.01.029zbMath1330.93028arXiv1509.08053OpenAlexW2240032506MaRDI QIDQ5962832
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
matrix completionfinite fieldobservable pairreachable pairunimodular matrix polynomialzero kernel pair
Matrices over special rings (quaternions, finite fields, etc.) (15B33) Observability (93B07) Attainable sets, reachability (93B03) Matrix pencils (15A22) Matrix completion problems (15A83)
Related Items
The number of linear transformations defined on a subspace with given invariant factors ⋮ Polynomial matrices, splitting subspaces and Krylov subspaces over finite fields ⋮ Enumerating partial linear transformations in a similarity class ⋮ Unimodular polynomial matrices over finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matrix completion problems
- On the number of controllable linear systems over a finite field
- Existenzsätze in der Theorie der Matrizen und lineare Kontrolltheorie
- Partially specified matrices and operators: classification, completion, applications
- The probability of rectangular unimodular matrices over \(\mathbb F_q[x\)]
- Topology of the moduli space for reachable linear dynamical systems: The complex case
- Reachability of Random Linear Systems over Finite Fields