Rectangular finite free probability theory

Abstract

We study a new type of polynomial convolution that serves as the foundation for building what we call rectangular finite free probability theory, generalizing the square finite free probability theory of Marcus, Spielman and Srivastava. We relate this operation to large rectangular random matrices and explain how it acts on singular values of rectangular matrices in a canonical way. Furthermore, we obtain nontrivial inequalities on roots of polynomials and build some appropriate tools, e.g. the analogue of the classical $R$-transforms. These developments are inspired by well-known results and concepts from probability theory. We also show that classical orthogonal polynomials such as Gegenbauer or Laguerre polynomials naturally arise through this convolution. Consequently, we deduce new nontrivial properties about the positions of the roots of these polynomials. As an application, we give an elegant proof of the existence of biregular bipartite Ramanujan graphs