We discuss shock reflection problem for compressible gas dynamics, von Neumann conjectures on transition between regular and Mach reflections, and existence of regular reflection solutions for potential flow equation. Then we will talk about recent results on uniqueness and stability of regular reflection solutions for potential flow equation in a natural class of self-similar solutions. The approach is to reduce the shock reflection problem to a free boundary problem for a nonlinear elliptic equation, and prove uniqueness by a version of method of continuity. A property of solutions important for the proof of uniqueness is convexity of the free boundary. 

This talk is based on joint works with G.-Q. Chen and W. Xiang.

In recent years it has been discovered that also non-linear, degenerate equations like the $p$-Poisson equation $$ -\mathrm{div}(A(\nabla u))= - \mathrm{div} (|\nabla u|^{{p-2}}\nabla u)= -{\rm div} F$$ allow for optimal regularity. This equation has similarities to the one of power-law fluids. In particular, the non-linear mapping $F \mapsto A(\nabla u)$ satisfies surprisingly the linear, optimal estimate $\|A(\nabla u)\|_X \le c\, \|F\|_X$ for several choices of spaces $X$. In particular, this estimate holds for Lebesgue spaces $L^q$ (with $q \geq p'$), spaces of bounded mean oscillations and Holder spaces$C^{0,\alpha}$ (for some $\alpha>0$).

In this talk we show that we can extend this theory to Sobolev and Besov spaces of (almost) one derivative. Our result are restricted to the case of the plane, since we use complex analysis in our proof. Moreover, we are restricted to the super-linear case $p \geq 2$, since the result fails $p < 2$. Joint work with Anna Kh. Balci, Markus Weimar.

The talk introduces the problem of completing a partially observed matrix whose columns obey a nonlinear structure. This is an extension of classical low-rank matrix completion where the structure is linear. Such matrices are in general full rank, but it is often possible to exhibit a low rank structure when the data is lifted to a higher dimensional space of features. The presence of a nonlinear lifting makes it impossible to write the problem using common low-rank matrix completion formulations. We investigate formulations as a nonconvex optimisation problem and optimisation on Riemannian manifolds.

This work determines an aim point selection strategy for players in order to improve their chances of winning at the classic darts game of 501. Although many previous studies have considered the problem of aim point selection in order to maximise the expected score a player can achieve, few have considered the more general strategical question of minimising the expected number of turns required for a player to finish. By casting the problem as a Markov decision process, a framework is derived for the identification of the optimal aim point for a player in an arbitrary game scenario.

There is no more classical problem of numerical PDE than the Laplace equation in a polygon, but Abi Gopal and I think we are on to a big step forward. The traditional approaches would be finite elements, giving a 2D representation of the solution, or integral equations, giving a 1D representation. The new approach, inspired by an approximation theory result of Donald Newman in 1964, leads to a "0D representation" -- the solution is the real part of a rational function with poles clustered exponentially near the corners of the polygon. The speed and accuracy of this approach are remarkable. For typical polygons of up to 8 vertices, we can solve the problem in less than a second on a laptop and evaluate the result in a few microseconds per point, with 6-digit accuracy all the way up to the corner singularities. We don't think existing methods come close to such performance. Next step: Helmholtz?
 

Matrix completion is an area of great mathematical interest and has numerous applications, including recommender systems for e-commerce. The recommender problem can be viewed as follows: given a database where rows are users and and columns are products, with entries indicating user preferences, fill in the entries so as to be able to recommend new products based on the preferences of other users. Viewing the interactions between user and product instead as interactions between potential drug chemicals and disease-causing target proteins, the problem is that faced within the realm of drug discovery. We propose a divide and conquer algorithm inspired by the work of [1], who use recursive rank-1 approximation. We make the case for using an LP rank-1 approximation, similar to that of [2] by a showing that it guarantees a 2-approximation to the optimal, even in the case of missing data. We explore our algorithm's performance for different test cases.

[1]  Shen, B.H., Ji, S. and Ye, J., 2009, June. Mining discrete patterns via binary matrix factorization. In Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 757-766). ACM.

[2] Koyutürk, M. and Grama, A., 2003, August. PROXIMUS: a framework for analyzing very high dimensional discrete-attributed datasets. In Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining (pp. 147-156). ACM.

Combining work of Galkin, Christopherson-Ilten, and Coates-Corti-Galkin-Golyshev-Kasprzyk we see that all smooth Fano threefolds admit a toric degeneration. We can use this fact to uniformly construct all Fano threefolds: given a choice of a fan we classify reflexive polytopes which break into unimodular pieces along this fan. We can then construct closed torus invariant embeddings of the corresponding toric variety using a technique - Laurent inversion - developed with Coates and Kaspzryk. The corresponding binomial ideal is controlled by the chosen fan, and in low enough codimension we can explicitly test deformations of this toric ideal. We relate the constructions we obtain to known constructions. We study the simplest case of the above construction, closely related to work of Abouzaid-Auroux-Katzarkov, in arbitrary dimension and use it to produce a tropical interpretation of the mirror superpotential via broken lines. We expect the computation to be the tropical analogue of a Floer theory calculation.

It is shown by Kashiwara and Schapira (1980s) that for every constructible sheaf on a smooth manifold, one can construct a closed conic Lagrangian subset of its cotangent bundle, called the microsupport of the sheaf. This eventually led to the equivalence of the category of constructible sheaves on a manifold and the Fukaya category of its cotangent bundle by the work of Nadler and Zaslow (2006), and Ganatra, Pardon, and Shende (2018) for partially wrapped Fukaya categories. One can try to generalise this and conjecture that Fukaya category of a Weinstein manifold can be given by constructible (microlocal) sheaves associated to its skeleton. In this talk, I will explain these concepts and confirm the conjecture for a family of Weinstein manifolds which are certain quotients of A_n-Milnor fibres. I will outline the computation of their wrapped Fukaya categories and microlocal sheaves on their skeleta, called pinwheels.