Danzer-Grünbaum's theorem revisited (Q5932654)

Let \(f(\alpha)\) be the maximum number of vertices of a convex polyhedron in \(E^3\) such that all angles between any two adjacent edges of the polyhedron are less than or equal to \(\alpha\). According to a result by \textit{H. T. Croft} [J. Lond. Math. Soc. 36, 289-306 (1961; Zbl 0102.37005)] \(f(\alpha)\) satisfies the inequality \(f(\alpha)\leq 5\) when \(\alpha \in ]0,\frac \pi 2 [\) . By using a spherical geometry version of a theorem by \textit{J. Pál} [Math. Ann. 83, 311-319 (1921; JFM 48.0838.02)], the authors prove in the present paper that \[ f(\alpha)\leq \left\lfloor \frac{4\pi}{2\pi -3\alpha}\right\rfloor \] whenever \(\alpha \in [\frac \pi 2,\frac {2\pi} 3[ \). Furthermore, they prove that any finite set in \(E^d\), having minimum distance 1 and maximum distance \(\leq \sqrt 2\), has at most \(2^{0.401d(1+\sigma(1))}\) points.