Minimal completion problem for quasi-regular matrix pencils

In the solution we use combinatorial methods involving LR coefficients, a solution of the Carlson problem and localization techniques. The result is given over algebraically closed fields.