Row or column completion of polynomial matrices of given degree II

Abstract

The row (column) completion problem of polynomial matrices of given degree with prescribed eigenstructure has been studied in AmBaMaRo23, where several results of prescription of some of the four types of invariants that form the eigenstructure have also been obtained. In this paper we conclude the study, solving the completion for the cases not covered there. More precisely, the row completion problem of a polynomial matrix is solved when we prescribe the infinite (finite) structure and column and/or row minimal indices, and finally the column and/or row minimal indices. The necessity of the characterizations obtained holds to be true over arbitrary fields in all cases, whilst to prove the sufficiency it is required, in some of the cases, to work over algebraically closed fields.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…