Lower bound for the maximal number of facets of a 0/1 polytope (Q2571320)

Improving on earlier work of \textit{I. Bárány} and \textit{A. Pór} [Adv. Math.~161, 209--228 (2001; Zbl 0988.52014)], the authors show the following. Let \(f_{n-1}(P)\) denote the number of facets of an \(n\)-polytope \(P\). Then there exists an absolute constant \(c > 0\) such that there is, for each \(n\), an \(n\)-dimensional \(0/1\)-polytope \(P\) (that is, with vertices in \(\{0,1\}^n\)), for which \[ f_{n-1}(P) \geq \left(\frac{cn}{\log^2n}\right)^{n/2}. \] In a note added in proof, they announce an improvement of this result, with the term \(\log^2n\) replaced by \(\log n\).