Previous Conferences & Workshops

A graph G is called a small set expander if any small set of vertices contains only a small fraction of the edges adjacent to it. This talk is mainly concerned with the investigation of small set expansion on the Grassmann Graphs, a study that was...

In this talk, which reports on joint work with Jungsoo Kang, we formulate a local systolic inequality for Reeb flows and Hamiltonian diffeomorphisms, which we establish in low dimension. As a consequence, we derive bounds for the minimal magnetic...

In this talk I will present a survey of some of the famous results and examples in the classical theory of minimal and constant mean curvature surfaces in R^3. The first examples of minimal surfaces were found by Euler (catenoid) around 1741...

We consider adversarial online learning in a non-convex setting under the assumption that the learner has an access to an offline optimization oracle. In the most general unstructured setting of prediction with expert advice, Hazan and Koren (2016)...

Edit distance is a widely used measure of similarity of two strings based on the minimum number of character insertions, deletions, and substitutions required to transform one string into the other. The edit distance can be computed exactly using a...

In this talk, we will recall the strong openness property of multiplier ideal sheaves (conjectured by Demailly and proved by Guan-Zhou), and then present some recent related progress including some joint work with Professor Xiangyu Zhou.

Abstract: This will be a summary of the closed discussions and an opportunity for everyone to contribute suggestions.