Many triangulated odd-dimensional spheres

From MaRDI portal



Abstract: It is known that the (2k−1)-sphere has at most 2O(nklogn) combinatorially distinct triangulations with n vertices, for every kge2. Here we construct at least 2Omega(nk) such triangulations, improving on the previous constructions which gave 2Omega(nk−1) in the general case (Kalai) and 2Omega(n5/4) for k=2 (Pfeifle-Ziegler). We also construct 2Omegaleft(nk−1+frac1kight) geodesic (a.k.a. star-convex) n-vertex triangualtions of the (2k−1)-sphere. As a step for this (in the case k=2) we construct n-vertex 4-polytopes containing Omega(n3/2) facets that are not simplices, or with Omega(n3/2) edges of degree three.


Given integer numbers \(k\), \(n\). One may ask: How many combinatorially distinct triangulations on \(n\) vertices has the \((2k-1)\)-sphere? The upper bound for such number is \(2^{O(n^k\log n)}\). In this paper, the authors construct at least \(2^{\Omega(n^k)}\) of such triangulations improving previous constructions both in general case and in particular case \(k=2\). The authors also construct \(2^{\Omega(n^k-1+1/k)}\) geodesic (i.e., star-convex) \(n\)-vertex triangulations of the \((2k-1)\)-sphere.











This page was built for publication: Many triangulated odd-dimensional spheres

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q261399)