Kazhdan-Lusztig Equivalence at the Iwahori Level
Abstract
Timelike Liouville gravity on the sphere and the disk
Abstract
Liouville conformal field theory models two-dimensional gravity with a cosmological constant and conformal matter. In its timelike regime, it reproduces the characteristic negative kinetic term of the conformal factor of the metric in the Einstein-Hilbert action, the sign which infamously makes the gravity path integral ill-defined. In this talk, I will first discuss the perturbative computation of the timelike Liouville partition function around the sphere saddle and propose an all-orders result. I will then turn to the disk and present the bulk 1-point functions of this CFT, and discuss possible interpretations in terms of boundary conditions.
Modeling and Design Optimization for Pleated Membrane Filters
Abstract
Statics and dynamics of droplets on lubricated surfaces
Zhaohe Dai
The abstract is "Slippery liquid infused porous surfaces are formed by coating surface with a thin layer of oil lubricant. This thin layer prevents other droplets from reaching the solid surface and allows such deposited droplets to move with ultra-low friction, leading to a range of applications. In this talk, we will discuss the static and dynamic behaviour of droplets placed on lubricated surfaces. We will show that the layer thickness and the size of the substrate are key parameters in determining the final equilibrium. However, the evolution towards the equilibrium is extremely slow (on the order of days for typical experimental parameter values). As a result, we suggest that most previous experiments with oil films lubricating smooth substrates are likely to have been in an evolving, albeit slowly evolving, transient state.
Modeling and Design Optimization for Pleated Membrane Filters
Yixuan Sun
Membrane filtration is widely used in many applications, ranging from industrial processes to everyday living activities. With growing interest from both industrial and academic sectors in understanding the various types of filtration processes in use, and in improving filter performance, the past few decades have seen significant research activity in this area. Experimental studies can be very valuable, but are expensive and time-consuming, therefore theoretical studies offer potential as a cost-effective and predictive way to improve on current filter designs. In this work, mathematical models, derived from first principles and simplified using asymptotic analysis, are proposed for pleated membrane filters, where the macroscale flow problem of Darcy flow through a pleated porous medium is coupled to the microscale fouling problem of particle transport and deposition within individual pores of the membrane. Asymptotically-simplified models are used to describe and evaluate the membrane performance numerically and filter design optimization problems are formulated and solved for industrially-relevant scenarios. This study demonstrates the potential of such modeling to guide industrial membrane filter design for a range of applications involving purification and separation.
Highly accurate protein structure prediction with AlphaFold
Abstract
Predicting a protein’s structure from its primary sequence has been a grand challenge in biology for the past 50 years, holding the promise to bridge the gap between the pace of genomics discovery and resulting structural characterization. In this talk, we will describe work at DeepMind to develop AlphaFold, a new deep learning-based system for structure prediction that achieves high accuracy across a wide range of targets. We demonstrated our system in the 14th biennial Critical Assessment of Protein Structure Prediction (CASP14) across a wide range of difficult targets, where the assessors judged our predictions to be at an accuracy “competitive with experiment” for approximately 2/3rds of proteins. The talk will cover both the underlying machine learning ideas and the implications for biological research as well as some promising further work.
Geometry of Molecular Conformations in Cryo-EM
Abstract
Cryo-Electron Microscopy (cryo-EM) is an imaging technology that is revolutionizing structural biology. Cryo-electron microscopes produce many very noisy two-dimensional projection images of individual frozen molecules; unlike related methods, such as computed tomography (CT), the viewing direction of each particle image is unknown. The unknown directions and extreme noise make the determination of the structure of molecules challenging. While other methods for structure determination, such as x-ray crystallography and NMR, measure ensembles of molecules, cryo-electron microscopes produce images of individual particles. Therefore, cryo-EM could potentially be used to study mixtures of conformations of molecules. We will discuss a range of recent methods for analyzing the geometry of molecular conformations using cryo-EM data.
Smooth over-parametrized solvers for non-smooth structured optimisation
Abstract
Non-smooth optimization is a core ingredient of many imaging or machine learning pipelines. Non-smoothness encodes structural constraints on the solutions, such as sparsity, group sparsity, low-rank and sharp edges. It is also the basis for the definition of robust loss functions such as the square-root lasso. Standard approaches to deal with non-smoothness leverage either proximal splitting or coordinate descent. The effectiveness of their usage typically depend on proper parameter tuning, preconditioning or some sort of support pruning. In this work, we advocate and study a different route. By over-parameterization and marginalising on certain variables (Variable Projection), we show how many popular non-smooth structured problems can be written as smooth optimization problems. The result is that one can then take advantage of quasi-Newton solvers such as L-BFGS and this, in practice, can lead to substantial performance gains. Another interesting aspect of our proposed solver is its efficiency when handling imaging problems that arise from fine discretizations (unlike proximal methods such as ISTA whose convergence is known to have exponential dependency on dimension). On a theoretical level, one can connect gradient descent on our over-parameterized formulation with mirror descent with a varying Hessian metric. This observation can then be used to derive dimension free convergence bounds and explains the efficiency of our method in the fine-grids regime.
Tomographic Strichartz inequalities for the Schrodinger equation
Abstract
The aim of this talk is to present some novel inequalities for the k-plane transform acting on the modulus square of solutions of the linear time-dependent Schrodinger equation. Our motivation for studying these tomographic expressions comes for virial identities in the context of Schrodinger equations, where tomographic Strichartz estimates of the type we will discuss here appear naturally.
Nematic Liquid crystal flows with free boundary
Abstract
I will introduce a new parabolic system for the flow of nematic liquid crystals, enjoying a free boundary condition. After recent works related to the construction of blow-up solutions for several critical parabolic problems (such as the Fujita equation, the heat flow of harmonic maps, liquid crystals without free boundary, etc...), I will construct a physically relevant weak solution blowing-up in finite time. We make use of the so-called inner/outer parabolic gluing. Along the way, I will present a set of optimal estimates for the Stokes operator with Navier slip boundary conditions. I will state several open problems related to the partial regularity of the system under consideration. This is joint work with F.-H. Lin (NYU), Y. Zhou (JHU) and J. Wei (UBC).
The importance of being convex
Abstract
In the plane, we know that area of a set is monotone with respect to the inclusion but perimeter fails, in general. If we consider only bounded and convex sets, then also the perimeter is monotone. This property allows us to estimate the minimum number of convex components of a nonconvex set.
When studying integral functionals of the calculus of variations, convexity with respect to minors of the Jacobian matrix is a nice tool for proving existence and regularity of minimizers.
Sometimes it happens that the infimum of a functional on a set is less then the infimum taken on a dense subset: we usually refer to it as Lavrentiev phenomenon. In order to avoid it, convexity helps a lot.