The number of \(k\)-faces of a simple \(d\)-polytope (Q1283733)

The authors prove the following result. Given integers \(0\leq k<d<n\), there are numbers \(G(d,k)\) and \(N(d,k)\) such that there exists a simple \(d\)-polytope with \(n\) faces of dimension \(k\) whenever \(n>N(d,k)\) and \(G(d,k)\) is a divisor of \(n\); moreover, \(G(d,k)\) is described explicitly. As an example, \(G(d,0)=1\) or 2 as \(d\) is even or odd, and, improving on a result of \textit{N. Prabhu} [Ph. D. Thesis, New York University (1991)], they show that \(N(d,0)\leq cd\sqrt d\), with (asymptotically) \(c=\sqrt 2\) or 1, respectively.