On convexity of polynomial paths and generalized majorizations
From MaRDI portal
Publication:976710
Summary: In this paper we give some useful combinatorial properties of polynomial paths. We also introduce generalized majorization between three sequences of integers and explore its combinatorics. In addition, we give a new, simple, purely polynomial proof of the convexity lemma of E. M. de Sà and R. C. Thompson. All these results have applications in matrix completion theory
Recommendations
Cited in
(27)- Completion up to a matrix pencil with column minimal indices as the only nontrivial Kronecker invariants
- Double generalized majorization
- Combinatorics of polynomial chains
- Bounded rank perturbations of regular pencils over arbitrary fields
- Rank-one perturbations of matrix pencils
- The rank distance problem for pairs of matrices and a completion of quasi-regular matrix pencils
- Combinatorial aspects of extensions of Kronecker modules.
- Completion of quasi-regular matrix pencils
- scientific article; zbMATH DE number 7224104 (Why is no real title available?)
- On the combinatorics of extensions of preinjective Kronecker modules.
- On the Change of the Weyr Characteristics of Matrix Pencils After Rank-One Perturbations
- Rank one perturbations of matrix pencils
- Double generalized majorization and diagrammatics
- Completion of matrix pencils with a single rank restriction
- Universal polynomial majorants on convex bodies
- Bounded rank perturbations of a regular matrix pencil
- Row or Column Completion of Polynomial Matrices of Given Degree
- Bounded Rank Perturbations of Quasi-Regular Pencils Over Arbitrary Fields
- Matrix pencils completions of size two
- Bounded rank perturbations of matrix pencils without nontrivial invariant factors
- One dimensional perturbation problem for linear relations
- Minimal rank perturbations of matrix pencils
- Row completion of polynomial and rational matrices
- Row or column completion of polynomial matrices of given degree. II
- Bounds for the change of the Weyr characteristic of matrix pencils after 1-rank perturbations
- Singular systems, state feedback problem
- Explicit solution of the row completion problem for matrix pencils
This page was built for publication: On convexity of polynomial paths and generalized majorizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976710)