Generic matrix polynomials with fixed rank and fixed degree
Andrii Dmytryshyn, Froil\'an M. Dopico

TL;DR
This paper characterizes the structure and eigenstructures of complex matrix polynomials with fixed rank and degree, revealing their geometric properties and closures in the space of all such polynomials.
Contribution
It provides a detailed description of the closures of sets of matrix polynomials with fixed rank and degree, including explicit eigenstructures and their union representations.
Findings
Sets of fixed-rank matrix polynomials are unions of closures of rank-specific subsets.
Complete eigenstructures are explicitly described for these sets.
Full-rank rectangular polynomials form a single closure of a specific eigenstructure set.
Abstract
The set of complex matrix polynomials of grade and (normal) rank at most in a complex dimensional space is studied. For , we show that is the union of the closures of the sets of matrix polynomials with rank , degree exactly , and explicitly described complete eigenstructures. In addition, for the full-rank rectangular polynomials, i.e. and , we show that coincides with the closure of a single set of the polynomials with rank , degree exactly , and the described complete eigenstructure. These complete eigenstructures correspond to generic matrix polynomials of grade and rank at most~.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Advanced Topics in Algebra · Mathematics and Applications
