Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Codimension one Embedding of Simplicial Complexes

Published 4 May 2016 in math.GT and math.CO | (1605.01240v2)

Abstract: We study $d$-dimensional simplicial complexes that are PL embeddable in $\mathbb{R}{d+1}$. It is shown that such a complex must satisfy a certain homological condition. The existence of this obstruction allows us to provide a systematic approach to deriving upper bounds for the number of top-dimensional faces of such complexes, particularly in low dimensions.

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.