Abstract

We study three convolutions of polynomials in the context of free probability theory. We prove that these convolutions can be written as the expected characteristic polynomials of sums and products of unitarily invariant random matrices. The symmetric additive and multiplicative convolutions were introduced by Walsh and Szegö in different contexts, and have been studied for a century. The asymmetric additive convolution, and the connection of all of them with random matrices, is new. By developing the analogy with free probability, we prove that these convolutions produce real rooted polynomials and provide strong bounds on the locations of the roots of these polynomials.

Highlights

  • We study three convolutions on polynomials that are inspired by free probability theory

  • We develop the analogy with Free Probability by proving that Voiculescu’s R and S-transforms can be used to prove upper bounds on the extreme roots of these polynomials

  • We show that for monic polynomials, the operation +d can be realized as an expected characteristic polynomial of a sum of random matrices

Read more

Summary

Introduction

We study three convolutions on polynomials that are inspired by free probability theory. Instead of capturing the limiting spectral distributions of ensembles of random matrices, we show that these capture the expected characteristic polynomials of random matrices in a fixed dimension. We develop the analogy with Free Probability by proving that Voiculescu’s R and S-transforms can be used to prove upper bounds on the extreme roots of these polynomials. Two of the convolutions have been classically studied. The third, and the connection of all of them with random matrices, is new. We begin by defining the three convolutions and stating the algebraic identities that establish this connection, as well as basic results regarding their real-rootedness properties

Algebraic identities and real rootedness
Motivation and related results
Transforms and root bounds
Polynomials of different degrees
Notation and organization
Equivalence of convolutions and E
Minor-orthogonality
Formulas
Symmetric additive and multiplicative convolutions
Asymmetric additive convolution
Real rootedness of the asymmetric additive convolution
Transform bounds
Symmetric additive convolution
Symmetric multiplicative convolution
Ultraspherical polynomials

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.