Centrally-symmetric tight surfaces and graph embeddings (Q2365254)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Centrally-symmetric tight surfaces and graph embeddings |
scientific article |
Statements
Centrally-symmetric tight surfaces and graph embeddings (English)
0 references
26 January 1998
0 references
Let \(M\) be a compact polyhedral (2-dimensional) surface (without boundary) in \(\mathbb{R}^d\), which is substantial (i.e., it is not contained in a hyperplane) and tight (i.e., for every half space \(h\subset \mathbb{R}^d\) the intersection \(M\cap h\) is connected). It is known that examples exist for arbitrarily high \(d\). In contrast, the author proves a sharp upper bound for the codimension in the case that the convex hull of \(M\) is a centrally-symmetric (i.e., invariant under \(-id_{\mathbb{R}^d})\) simplicial polytope, namely \[ 2(d-1) (d-3) \leq 3\bigl(2- \chi(M) \bigr). \] For \(d\geq 4\) equality holds if and only if \(M\) is a subcomplex of the \(d\)-octahedron with \(2d\) vertices. A second result gives a lower bound for the number of vertices of a surface triangulation admitting a fixed-point free involution.
0 references
tight centrally-symmetric surfaces
0 references
tight polyhedral surfaces
0 references
codimension
0 references
triangulation
0 references