The session will be a panel discussion addressing practical aspects of doing a research degree. We will take questions from the audience so will discuss whatever people wish to ask us, but we expect to talk about the process of applying, why you might want to consider doing a research degree, the experience of doing research, and what people do after they have completed their degree.

In this interactive workshop, we'll discuss what mathematicians are looking for in written solutions.  How can you set out your ideas clearly, and what are the standard mathematical conventions?

This session is likely to be most relevant for first-year undergraduates, but all are welcome.

This session is particularly aimed at fourth-year and OMMS students who are completing a dissertation this year. The talk will be given by Dr Richard Earl who chairs Projects Committee. For many of you this will be the first time you have written such an extended piece on mathematics. The talk will include advice on planning a timetable, managing the workload, presenting mathematics, structuring the dissertation and creating a narrative, providing references and avoiding plagiarism.

Steklov eigenproblems and their variants (where the spectral parameter appears in the boundary condition) arise in a range of useful applications. For instance, understanding some properties of the mixed Steklov-Neumann eigenfunctions tells us why we shouldn't use coffee cups for expensive brandy. 

In this talk I'll present a high-accuracy discretization strategy for computing Steklov eigenpairs. The strategy can be used to study questions in spectral geometry, spectral optimization and to the solution of elliptic boundary value problems with Robin boundary conditions.

--

A link for the talk will be sent to our mailing list a day or two in advance.  If you are not on the list and wish to be sent a link, please contact @email.

Averages of multiplicative eigenvalue statistics of Haar distributed unitary matrices are Toeplitz determinants, and asymptotics for these determinants are now well understood for large classes of symbols, including symbols with gaps and (merging) Fisher-Hartwig singularities. Similar averages for Haar distributed orthogonal matrices are Toeplitz+Hankel determinants. Some asymptotic results for these determinants are known, but not in the same generality as for Toeplitz determinants. I will explain how one can systematically deduce asymptotics for averages in the orthogonal group from those in the unitary group, using a transformation formula and asymptotics for certain orthogonal polynomials on the unit circle, and I will show that this procedure leads to asymptotic results for symbols with gaps or (merging) Fisher-Hartwig singularities. The talk will be based on joint work with Gabriel Glesner, Alexander Minakov and Meng Yang.

This talk is intended for a broad math and physics audience in particular including students. It will focus on the speaker’s recent contributions to the analysis of the real Ginibre ensemble consisting of square real matrices whose entries are i.i.d. standard normal random variables. In sharp contrast to the complex and quaternion Ginibre ensemble, real eigenvalues in the real Ginibre ensemble attain positive likelihood. In turn, the spectral radius of a real Ginibre matrix follows a different limiting law for purely real eigenvalues than for non-real ones. We will show that the limiting distribution of the largest real eigenvalue admits a closed form expression in terms of a distinguished solution to an inverse scattering problem for the Zakharov-Shabat system. This system is directly related to several of the most interesting nonlinear evolution equations in 1 + 1 dimensions which are solvable by the inverse scattering method. The results of this talk are based on our joint work with Jinho Baik (arXiv:1808.02419 and arXiv:2008.01694)

I will describe a general method for comparing the counting functions of determinantal point processes in terms of trace class norm distances between their kernels (and review what all of those words mean). Then I will outline joint work with Elizabeth Meckes using this method to prove a version of a self-similarity property of eigenvalues of Haar-distributed unitary matrices conjectured by Coram and Diaconis.  Finally, I will discuss ongoing work by my PhD student Kyle Taljan, bounding the rate of convergence for counting functions of GUE eigenvalues to the Sine or Airy process counting functions.

Classical random matrix theory begins with a random matrix model and analyzes the distribution of the resulting eigenvalues.  In this work, we treat the reverse question: if the eigenvalues are specified but the matrix is "otherwise random", what do the entries typically look like?  I will describe a natural model of random matrices with prescribed eigenvalues and discuss a central limit theorem for projections, which in particular shows that relatively large subcollections of entries are jointly Gaussian, no matter what the eigenvalue distribution looks like.  I will discuss various applications and interpretations of this result, in particular to a probabilistic version of the Schur--Horn theorem and to models of quantum systems in random states.  This work is joint with Mark Meckes.