Font Size: 

I will present recent advances on the general matrix pencils completion problem. This problem consists of describing the popssible Kronecker invriants of a matrix pencil whose arbitrary subpencil is prescribed. Apart from general fundamental interest, this problem and its particular cases are of high importance in applications in control theory. In particular, I will present novel combinatorial techniques that we introduced, and that were crucial for resolving important particular cases of the general problem.