Row completion of polynomial and rational matrices

We characterize the existence of a polynomial (rational) matrix when its eigenstructure (complete structural data) and some of its rows are prescribed. For polynomial matrices, this problem was solved in [1] when the polynomial matrix has the same degree as the prescribed submatrix. In that paper, the following row completion problems were also solved arising when the eigenstructure was partially prescribed, keeping the restriction on the degree: the eigenstructure but the row (column) minimal indices, and the finite and/or infinite structures. Here we remove the restriction on the degree, allowing it to be greater than or equal to that of the submatrix. We also generalize the results to rational matrices. Obviously, the results obtained hold for the corresponding column completion problems.