English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Despite a full characterization of the face vectors of simple and simplicialpolytopes, the face numbers of general polytopes are poorly understood. Around1997, B\'ar\'any asked whether for all convex $d$-polytopes $P$ and all $0 \leqk \leq d-1$, $f_k(P) \geq \min\{f_0(P), f_{d-1}(P)\}$. We answer B\'ar\'any'squestion in the affirmative and prove a stronger statement: for all convex$d$-polytopes $P$ and all $0 \leq k \leq d-1$, \[ \frac{f_k(P)}{f_0(P)} \geq\frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} + {\lfloor \frac{d}{2}\rfloor \choose k}\biggr], \qquad \frac{f_k(P)}{f_{d-1}(P)} \geq\frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose d-k-1} + {\lfloor\frac{d}{2} \rfloor \choose d-k-1}\biggr]. \] In the former, equality holdsprecisely when $k=0$ or when $k=1$ and $P$ is simple. In the latter, equalityholds precisely when $k=d-1$ or when $k=d-2$ and $P$ is simplicial.

A Positive Answer to B\'ar\'any's Question on Face Numbers of Polytopes