Generic symmetric matrix pencils with bounded rank

Fernando De Terán, Andrii Dmytryshyn, Froilán M. Dopico

We show that the set of $n\times n$ complex symmetric matrix pencils of rank at most $r$ is the union of the closures of $\lfloor r/2\rfloor +1$ sets of matrix pencils with some,…