Associated to a finite graph without loops is the Kac-Moody Lie algebra for the Cartan matrix whose off diagonal entries are (minus) the adjacency matrix for the graph.  Two famous conjectures of Kac, proved by Hausel, Letellier and Villegas, hint that there may be some larger cohomologically graded algebra associated to the graph (even if there are loops), providing "higher" Kac moody Lie algebras, or at least their positive halves.  Using work with Sven Meinhardt, I will give a geometric construction of the (full) Kac-Moody algebra for a general finite graph, using cohomological DT theory.  Along the way we'll see a proof of the positivity conjecture for the modified Kac polynomials of Bozec, Schiffmann and Vasserot counting various types of representations of quivers.

Large parts of the cryptography in use today,

key-agreement protocols and digital signatures based on the

hardness of factoring large integers or solving the

discrete-logarithm problem, are not secure against attackers

equipped with a large universal quantum computer. It is not

clear when such a large quantum computer will be built, but

continuous progress by various labs around the world suggests

that it may well be less than two decades until today's

cryptography will become insecure.

To address this issue, NIST started a public competition to

identify suitable replacements for today's cryptosystems. In

my talk, I will describe two of these systems: the

key-encapsulation mechanism Kyber and the digital signature

scheme Dilithium. Both schemes are based on the hardness of

solving problems in module lattices and they together form the

"Cryptographic Suite for Algebraic Lattices -- CRYSTALS".

Let $F$ be a non-Archimedean local field with ring of integers $\mathcal O$ and maximal ideal $\mathfrak p$. T. Shintani and G. Hill independently introduced a large class of smooth representations of $GL_N(\mathcal O)$, called regular representations. Roughly speaking they correspond to elements in the Lie algebra $M_N(\mathcal O)$ which are regular mod $\mathfrak p$ (i.e, having centraliser of dimension $N$). The study of regular representations of $GL_N(\mathcal O)$ goes back to Shintani in the 1960s, and independently and later, Hill, who both constructed the regular representations with even conductor, but left the much harder case of odd conductor open. In recent simultaneous and independent work, Krakovski, Onn and Singla gave a construction of the regular representations of $GL_N(\mathcal O)$ when the residue characteristic of $\mathcal O$ is not $2$.

In this talk I will present a complete construction of all the regular representations of $GL_N(\mathcal O)$. The approach is analogous to, and motivated by, the construction of supercuspidal representations of $GL_N(F)$ due to Bushnell and Kutzko. This is joint work with Shaun Stevens.
 

High-order methods for conservation laws can be highly efficient if their stability is ensured. A suitable means mimicking estimates of the continuous level is provided by summation-by-parts (SBP) operators and the weak enforcement of boundary conditions. Recently, there has been an increasing interest in generalised SBP operators both in the finite difference and the discontinuous Galerkin spectral element framework.

However, if generalised SBP operators are used, the treatment of boundaries becomes more difficult since some properties of the continuous level are no longer mimicked discretely —interpolating the product of two functions will in general result in a value different from the product of the interpolations. Thus, desired properties such as conservation and stability are more difficult to obtain.

In this talk, the concept of generalised SBP operators and their application to entropy stable semidiscretisations will be presented. Several recent ideas extending the range of possible methods are discussed, presenting both advantages and several shortcomings.

After a brief review on the classical Prandtl system, we introduce our recent work on the well-posedness and high Reynolds numbers limit for the MHD boundary layer that shows the tangential magnetic field stabilizes the boundary layer. And then we will discuss some instability phenomena of the shear flow for both the classical Prandtl and MHD boundary layer systems. The talk includes some recent joint works with Chengjie Liu, Yaguang Wang on the classical Prandtl equation, and with Chengjie Liu and Feng Xie on the magnetohydrodynamic boundary layer.

We consider a generalization of low-rank matrix completion to the case where the data belongs to an algebraic variety, i.e., each data point is a solution to a system of polynomial equations. In this case, the original matrix is possibly high-rank, but it becomes low-rank after mapping each column to a higher dimensional space of monomial features. Many well-studied extensions of linear models, including affine subspaces and their union, can be described by a variety model. We study the sampling requirements for matrix completion under a variety model with a focus on a union of subspaces. We also propose an efficient matrix completion algorithm that minimizes a surrogate of the rank of the matrix of monomial features, which is able to recover synthetically generated data up to the predicted sampling complexity bounds. The proposed algorithm also outperforms standard low-rank matrix completion and subspace clustering techniques in experiments with real data.