|
Organizers |
Geometric complexity of embeddings
by
Slava Krushkal
University of Virginia
There are various notions of geometric complexity of embeddings: thickness, distortion, the minimal number of subdivisions needed for a PL embedding. I will discuss several problems concerning complexity of knots and links in 3-space, and complexity of embeddings in higher dimensions.
Date received: November 24, 2015
Copyright © 2015 by the author(s). The author(s) of this work and the organizers of the conference have granted their consent to include this abstract in Topology Atlas. Document # cblw-39.