English

On links of vertices in simplicial $d$-complexes embeddable in the euclidean $2d$-space

Computational Geometry 2020-01-28 v8 Discrete Mathematics Combinatorics

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 (2d1)(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 d2d \geq 2. Moreover, the bound is also true for the size of dd-complexes linklessly embeddable in the (2d+1)(2d+1)-dimensional space.

Keywords

Cite

@article{arxiv.1512.05164,
  title  = {On links of vertices in simplicial $d$-complexes embeddable in the euclidean $2d$-space},
  author = {Salman Parsa},
  journal= {arXiv preprint arXiv:1512.05164},
  year   = {2020}
}