HD-Combinatorics: Shai Evra, "Gromov-Guth embedding complexity"

In this talk we shall review a paper by Gromov and Guth, in which they introduced several ways to measure the geometric complexity of an embedding of simplicial complexes to Euclidean spaces. One such measurement is strongly related to the notion of high dimensional expanders introduced by Gromov, and in fact, it is based on a paper of Kolmogorov and Barzadin from 1967, in which the notion of an expander graph appeared implicitly. We shall show one application of bounded degree high dimensional expanders, and present many more open questions arising from the above mentioned paper.

Date: 

Mon, 04/06/2018 - 14:00 to 15:50

Location: 

Feldman Building, Givat Ram