On \(k\)-stacked polytopes (Q789008): Difference between revisions

If the simplicial \(d\)-polytope \(P\) has \(f_ i\) faces of dimension \(i=- 1,0,\dots,d-1 (f_{-1}=1)\), and \(h_ i=\sum^{i}_{j=0}\left( \begin{matrix} d-j\\ d-i\end{matrix} \right)(-1)^{i-j}f_{j-1}\), then \(h(P)=(h_ 0,\dots,h_ d)\) is called the h-vector of \(P\). The reviewer and \textit{D. W. Walkup} [Mathematika 18, 264--273 (1971); Zbl 0233.52003] conjectured that \(h_ k\geq h_{k-1}\) for \(k=1,\dots,[\frac{1}{2}d]\), with equality characterizing \(P\) as \((k-1)\)-stacked, meaning that \(P\) admits a subdivision into a simplicial \(d\)-complex, every \((d-k)\)-face of which is a face of \(P\). \textit{R. P. Stanley} [Adv. Math. 35, 236--238 (1980; Zbl 0427.52006)] verified the inequality, in his part of the proof of the reviewer's conditions for such h-vectors. The present authors deduce from \textit{L. J. Billera} and \textit{C. W. Lee's} proof of the other part [J. Comb. Theory, Ser. A 31, 237--255 (1981; Zbl 0479.52006)] a somewhat weaker form of the conjecture that, if the h-vector satisfies McMullen's conditions with \(h_ k=h_{k-1}\), then it is the h-vector of some \((k-1)\)-stacked polytope.