Lower bound theorems for general polytopes

For a $d$-dimensional polytope with $v$ vertices, $d+1\le v\le2d$, we calculate precisely the minimum possible number of $m$-dimensional faces, when $m=1$ or $m\ge0.62d$. This confirms a conjecture of Gr\"unbaum, for these values of $m$. For $v=2d+1$, we solve the same problem when $m=1$ or $d-2$; the solution was already known for $m= d-1$. In all these cases, we give a characterisation of the minimising polytopes. We also show that there are many gaps in the possible number of $m$-faces: for example, there is no polytope with 80 edges in dimension 10, and a polytope with 407 edges can have dimension at most 23.Comment: 26 pages, 3 figure

Differentiable Rigidity under Ricci curvature lower bound

In this article we prove a differentiable rigidity result. Let $(Y, g)$ and $(X, g_0)$ be two closed $n$-dimensional Riemannian manifolds ($n\geqslant 3$) and $f:Y\to X$ be a continuous map of degree $1$. We furthermore assume that the metric $g_0$ is real hyperbolic and denote by $d$ the diameter of $(X,g_0)$. We show that there exists a number $\varepsilon:=\varepsilon (n, d)>0$ such that if the Ricci curvature of the metric $g$ is bounded below by $-n(n-1)$ and its volume satisfies \vol_g (Y)\leqslant (1+\varepsilon) \vol_{g_0} (X) then the manifolds are diffeomorphic. The proof relies on Cheeger-Colding's theory of limits of Riemannian manifolds under lower Ricci curvature bound.Comment: 33 pages, 1 dessi

An improved lower bound for Folkman's theorem

Folkman's Theorem asserts that for each $k \in \mathbb{N}$, there exists a natural number $n = F(k)$ such that whenever the elements of $[n]$ are two-coloured, there exists a set $A \subset [n]$ of size $k$ with the property that all the sums of the form $\sum_{x \in B} x$, where $B$ is a nonempty subset of $A$, are contained in $[n]$ and have the same colour. In 1989, Erd\H{o}s and Spencer showed that $F(k) \ge 2^{ck^2/ \log k}$, where $c >0$ is an absolute constant; here, we improve this bound significantly by showing that $F(k) \ge 2^{2^{k-1}/k}$ for all $k\in \mathbb{N}$.Comment: 5 pages, Bulletin of the LM