Papers
Topics
Authors
Recent
Search
2000 character limit reached

Linear embeddings of contractible and collapsible complexes

Published 20 Mar 2014 in math.MG, math.CO, and math.GT | (1403.5217v6)

Abstract: (1) We show that if a presentation of the trivial group is "hard to trivialize", in the sense that lots of Tietze moves are necessary to transform it into the trivial presentation, then the associated presentation complex (which is a contractible 2-dimensional cell complex) is "hard to embed in $\mathbb{R}3$", in the sense that lots of linear subdivisions are necessary. (2) For any d, we show that all collapsible d-complexes with n facets linearly embed in $\mathbb{R}{2d}$ after less than n barycentric subdivisions. This is best possible, as cones over non-planar graphs do not topologically embed in $\mathbb{R}{3}$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.