We consider vector-valued maps which minimize an energy with two terms: an elastic term penalizing high gradients, and a potential term penalizing values far away from a fixed submanifold N. In the scaling limit where the second term is dominant, minimizers converge to maps with values into the manifold N. If the elastic term is the classical Dirichlet energy (i.e. the squared L^2-norm of the gradient), classical tools show that this convergence is uniform away from a singular set where the energy concentrates. Some physical models (as e.g. liquid crystal models) include however more general elastic energies (still coercive and quadratic in the gradient, but less symmetric), for which these classical tools do not apply. We will present a new strategy to obtain nevertheless this uniform convergence. This is a joint work with Andres Contreras.

Lagrangian Floer homology has been used by Ozsvath and Szabo to define a package of three-manifold invariants known as Heegaard Floer homology. I will give an introduction to the topic.

I will talk about some basic facts about slope stable sheaves and the Bogomolov inequality.  New techniques from stability conditions will imply new stronger bounds on Chern characters of stable sheaves on some special varieties, including  Fano varieties, quintic threefolds and etc. I will discuss the progress in this direction and some related open problems.

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 as links in a bipartite graph, the problem is equivalent to approximating a partially observed graph using clusters. 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.
 

Abstract: The universal algorithm is a Turing machine program that can in principle enumerate any finite sequence of numbers, if run in the right model of PA, and furthermore, can always enumerate any desired extension of that sequence in a suitable end-extension of that model. The universal finite set is a set-theoretic analogue, a locally verifiable definition that can in principle define any finite set, in the right model of set theory, and can always define any desired finite extension of that set in a suitable top-extension of that model. Recent work has uncovered a $\Sigma_1$-definable version that works with respect to end-extensions. I shall give an account of all three results, which have a parallel form, and describe applications to the model theory of arithmetic and set theory. Post questions and commentary on my blog at http://jdh.hamkins.org/parallels-in-universality-oxford-math-logic-semi…;

For a reductive group $ G $, Steinberg established a map from the Weyl group to nilpotent $ G $-orbits using momentmaps on double flag varieties.  In particular, in the case of the general linear group, he re-interpreted the Robinson-Schensted correspondence between the permutations and pairs of standard tableaux of the same shape in terms of product of complete flags.

We generalize his theory to the case of symmetric pairs $ (G, K) $, and obtained two different maps.  In the case where $ (G, K) = (\GL_{2n}, \GL_n \times \GL_n) $, one of the maps is a generalized Steinberg map, which induces a generalization of the RS correspondence for degenerate permutations.  The other is an exotic moment map, which maps degenerate permutations to signed Young diagrams, i.e., $ K $-orbits in the Cartan space $ (\lie{g}/\lie{k})^* $.

We explain geometric background of the theory and combinatorial procedures which produces the above mentioned maps.

This is an on-going joint work with Lucas Fresse.
 

A matrix M of real numbers is called totally positive if every minor of M is nonnegative. This somewhat bizarre concept from linear algebra has surprising connections with analysis - notably polynomials and entire functions with real zeros, and the classical moment problem and continued fractions - as well as combinatorics. I will explain briefly some of these connections, and then introduce a generalization: a matrix M of polynomials (in some set of indeterminates) will be called coefficientwise totally positive if every minor of M is a polynomial with nonnegative coefficients. Also, a sequence (an)n≥0  of real numbers (or polynomials) will be called (coefficientwise) Hankel-totally positive if the Hankel matrix H = (ai+j)i,j ≥= 0 associated to (an) is (coefficientwise) totally positive. It turns out that many sequences of polynomials arising in enumerative combinatorics are (empirically) coefficientwise Hankel-totally positive; in some cases this can be proven using continued fractions, while in other cases it remains a conjecture.