Many triangulated odd-dimensional spheres (Q261399)

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.