Quicklists
Javascript must be enabled

Dominic Dotterrer : Algorithms for the isoperimetric problem in high dimensional cubes

Thinking of high dimensional cubes as large cellular complexes, we pose the question of finding for each cellular cycle, a small cellular chain which bounds it. We will describe an algorithm which solves this problem. The algorithm is based on a trichotomy which describes the different ways cycles can sit in a cube. We will give examples of large topological spheres which are cellularly embedded in the cubes in a purely combinatorial way. These cycles will show that the exponent obtained by our algorithm is sharp.

Add to Favorites

Please select playlist name from following

Create new playlist

Report Video

Please select the category that most closely reflects your concern about the video, so that we can review it and determine whether it violates our Community Guidelines or isn’t appropriate for all viewers. Abusing this feature is also a violation of the Community Guidelines, so don’t do it.

0 Comments

Comments Disabled For This Video