Almost-nonsingular entry pattern matrices
From MaRDI portal
Publication:2321365
DOI10.1016/J.LAA.2019.05.006zbMATH Open1418.15026OpenAlexW2945256813WikidataQ127841366 ScholiaQ127841366MaRDI QIDQ2321365FDOQ2321365
Publication date: 29 August 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.05.006
Recommendations
- On the maximum rank of completions of entry pattern matrices
- The nonsingular matrix completion problem
- Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates
- Partial matrices whose completions all have the same rank
- Singular, nonsingular, and bounded rank completions of ACI-matrices
Cites Work
- Title not available (Why is that?)
- On the irreducibility of certain trinomials
- Combinatorial matrix theory
- Handbook of finite fields
- On Matrices Whose Real Linear Combinations are Nonsingular
- Factorization of polynomials over finite fields
- Vector fields on spheres
- Title not available (Why is that?)
- Partial matrices whose completions have ranks bounded below
- Singular, nonsingular, and bounded rank completions of ACI-matrices
- Irreducible trinomials over finite fields
- On the distribution of irreducible trinomials over \(\mathbb F_3\)
- Nonsymmetric normal entry patterns with the maximum number of distinct indeterminates
- On the maximum rank of completions of entry pattern matrices
- Title not available (Why is that?)
Cited In (1)
This page was built for publication: Almost-nonsingular entry pattern matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2321365)