Combinatorics of polynomial chains
From MaRDI portal
Publication:2174474
DOI10.1016/j.laa.2019.12.028zbMath1437.05021OpenAlexW2997473222MaRDI QIDQ2174474
Publication date: 21 April 2020
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.12.028
Combinatorial inequalities (05A20) Polynomials in general fields (irreducibility, etc.) (12E05) Matrix completion problems (15A83)
Related Items (5)
A new approach to square matrix completion problem ⋮ Completion of matrix pencils with a single rank restriction ⋮ Unnamed Item ⋮ Bounded rank perturbations of a regular matrix pencil ⋮ The General Matrix Pencil Completion Problem: A Minimal Case
Cites Work
- Unnamed Item
- Unnamed Item
- Completion of quasi-regular matrix pencils
- On convexity of polynomial paths and generalized majorizations
- Matrices with prescribed rows and invariant factors
- Interlacing inequalities and control theory
- Interlacing inequalities for regular pencils
- Similarity invariants of completions of submatrices
- Interlacing inequalities for invariant factors
- Imbedding conditions for \(\lambda\)-matrices
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Eigenvalues of completions of submatrices
- Similarity class of a matrix with a prescribed submatrix
- The General Matrix Pencil Completion Problem: A Minimal Case
- Eigenvalues, invariant factors, highest weights, and Schubert calculus
- Descriptor Systems Under Feedback and Output Injection
This page was built for publication: Combinatorics of polynomial chains