Small-Set Expansion on the Grassmann Graph.

Dor Minzer
Member, School of Mathematics
October 23, 2018
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 motivated by recent applications to Probabilistically Checkable Proofs and hardness of approximation.

New and old results in the classical theory of minimal and constant mean curvature surfaces in Euclidean 3-space R^3

Bill Meeks
University of Massachusetts Amherst
October 22, 2018
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, Muesner (helicoid) around 1746 and Riemann (Riemann minimal examples) around 1860. The classical examples of non-zero constant mean curvature surfaces are the Delaunay surfaces of revolution found in 1841, which include round spheres and cylinders.

Approximating the edit distance to within a constant factor in truly subquadratic time.

Mike Saks
Rutgers University
October 22, 2018
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 classical dynamic programming algorithm that runs in quadratic time.