On links of vertices in simplicial dd-complexes embeddable in the euclidean 2d2d-space

preprint2020arXivOpen access

Abstract

We consider dd-dimensional simplicial complexes which can be PL embedded in the 2d2d-dimensional euclidean space. In short, we show that in any such complex, for any three vertices, the intersection of the link-complexes of the vertices is linklessly embeddable in the (2d−1)(2d-1)-dimensional euclidean space. These considerations lead us to a new upper bound on the total number of dd-simplices in an embeddable complex in 2d2d-space with nn vertices, improving known upper bounds, for all d≥2d \geq 2. Moreover, the bound is also true for the size of dd-complexes linklessly embeddable in the (2d+1)(2d+1)-dimensional space.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.