to follow

to follow

to follow

In 1962, Horn raised the following problem: Let A and B be n-by-n Hermitian matrices with respective eigenvalues a_1,...,a_n and b_1,...,b_n. What can we say about the possible eigenvalues c_1,...,c_n of A + B?

The deterministic perspective is that the set of possible values for c_1,...,c_n are described by a collection of inequalities known as the Horn inequalities.

Free probability offers the following alternative perspective on the problem: if (A_n) and (B_n) are independent sequences of n-by-n random matrices with empirical spectra converging to probability measures mu and nu respectively, then the random empirical spectrum of A_n + B_n converges to the free convolution of mu and nu.

But how are these two perspectives related?

In this talk Samuel Johnston will discuss approaches to free probability that bridge between the two perspectives. More broadly, Samuel will discuss how the fundamental operations of free probability (such as free convolution and free compression) arise out of statistical physics mechanics of corresponding finite representation theory objects (hives, Gelfand-Tsetlin patterns, characteristic polynomials, Horn inequalities, permutations etc).

This talk is based on joint work with Octavio Arizmendi (CIMAT, Mexico), Colin McSWiggen (Academia Sinica, Taiwan) and Joscha Prochno (Passau, Germany).

This talk by Tim Austin, at the University of Warwick, will be an introduction to "almost periodic entropy".  This quantity is defined for positive definite functions on a countable group, or more generally for positive functionals on a separable C*-algebra.  It is an analog of Lewis Bowen's "sofic entropy" from ergodic theory.  This analogy extends to many of its properties, but some important differences also emerge.  Tim will not assume any prior knowledge about sofic entropy.

After setting up the basic definition, Tim will focus on the special case of finitely generated free groups, about which the most is known.  For free groups, results include a large deviations principle in a fairly strong topology for uniformly random representations.  This, in turn, offers a new proof of the Collins—Male theorem on strong convergence of independent tuples of random unitary matrices, and a large deviations principle for operator norms to accompany that theorem.