Past Events

Many problems in science and engineering are described in terms of equilibrium shapes on which certain conditions are imposed and which separate regions where the solution may have different properties. A prototypical problem of this type involves...

Optimal transport (OT) problems, initiated by G. Monge 200 years ago and refined by L. Kantorovich in the 1940’s, provide --among other things-- a quantitative way for measuring correlations between probability distributions. Martingale optimal...

Insulin is an essential hormone that regulates nutrient homeostasis. Insufficient insulin results in diabetes, one of the most prevalent and costly diseases. Although the primary actions of insulin are to induce glucose uptake and metabolism in...

The Fukaya category of a Weinstein manifolds W algebraically package all Lagrangian submanifolds of W into an A-infinity category. In this talk I will motivate why studying Lagragian submanifolds in symplectic manifolds is relevant and then I will...

In the presentation we will discuss our research program concerning the study of extreme vortex events in viscous incompressible flows. These vortex states arise as the flows saturating certain fundamental mathematical estimates, such as the bounds...

The singular value decomposition (SVD) is one of the core computations of today's scientific applications and data analysis tools. The main goal is to compute a compact representation of a high dimensional operator, a matrix, or a set of data that...

We will discuss the Cohen-Lenstra heuristics, both in the classical and non-abelian setting. In particular we will make the connection between these heuristics and the problem of counting extensions of quadratic fields with fixed Galois groups, and...

Diophantine problem (the problem of algorithmic solvability of equations) is one of the classical problems in mathematics. This problem is decidable in algebraically closed fields, in the fields of real and p-adic numbers. Diophantine problem for...

We introduce the notion of a spoke algebra, which encodes the data of a $C_p$-equivariant cohomology equipped with a coherent system of norms. This is a generalization of the notion of an ``$\mathbb{E}_{\sigma}$-algebra" for the group $C_2$ and the...

The conjugate gradient algorithm (CG) is a widely used iterative method for solving large symmetric positive definite linear systems Ax=b. Beginning in the 1980's (and, even earlier, in the thesis of Paige dating back to 1971), a great deal of...