Explicit solution of the row completion problem for matrix pencils

In this paper we give new, explicit and simplified conditions for the problem of determining the possible strict equivalence class of a pencil with prescribed rows (columns). This improves the result from [1], and solves an important particular case of the challenge problem posed by Loiseau et al. [7]. All results that we present are obtained over arbitrary fields.