MenuFree Probability and Operators
Date: October 7, 2022
Time: 4:00PM - 5:00PM
Location: BLOC 306
Speaker: Michael Anshelevich, TAMU
Title: Equivalent definitions of finite free convolution
Abstract: I will prove the theorem of Marcus, Spielman, and Srivastava on the equivalence of two definitions of finite free convolution: one in terms of random matrices, the other explicit and combinatorial. The proof uses no machinery beyond (fairly) elementary matrix algebra.
