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.

The core idea behind metric spaces is the triangular inequality. Metrics have been generalized in many ways, but the most tempting way to alter them would be to "flip" the triangular inequality, obtaining an "anti-metric". This, however, only allows for trivial spaces where the distance between any two points is 0. However, if we intertwine the concept of antimetrics with the structures of partial linear--and cyclic--orders, we can define a structure where the anti-triangular inequality holds conditionally. We define this structure, give examples, and show an interesting result involving metrics and antimetrics.