Combinatorics of polynomial chains
From MaRDI portal
Recommendations
Cites work
- Assigning the Kronecker invariants of a matrix pencil by row or column completions
- Completion of quasi-regular matrix pencils
- Descriptor systems under feedback and output injection
- Eigenvalues of completions of submatrices
- Eigenvalues, invariant factors, highest weights, and Schubert calculus
- scientific article; zbMATH DE number 193053 (Why is no real title available?)
- scientific article; zbMATH DE number 3334252 (Why is no real title available?)
- Imbedding conditions for \(\lambda\)-matrices
- Interlacing inequalities and control theory
- Interlacing inequalities for invariant factors
- Interlacing inequalities for regular pencils
- Matrices with prescribed rows and invariant factors
- On convexity of polynomial paths and generalized majorizations
- Similarity class of a matrix with a prescribed submatrix
- Similarity invariants of completions of submatrices
- The General Matrix Pencil Completion Problem: A Minimal Case
Cited in
(11)- Polynomial isomorphisms of combinatorial objects
- Polynomials counting nowhere-zero chains in graphs
- New characteristics of some polynomial sequences in combinatorial theory
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- The General Matrix Pencil Completion Problem: A Minimal Case
- scientific article; zbMATH DE number 6161107 (Why is no real title available?)
- A new approach to square matrix completion problem
- Completion of matrix pencils with a single rank restriction
- Bounded rank perturbations of a regular matrix pencil
- Matrix pencils completions of size two
- Combinatorial families enumerated by quasi-polynomials
This page was built for publication: Combinatorics of polynomial chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174474)