Erdős Problem #651 — Subexponential higher-dimensional Erdős–Szekeres numbers
For integers and , a finite set is in general position if no of its points lie in one affine hyperplane. A subset is in convex position if all its points are vertices of its convex hull. Let be the least integer such that every set of points in general position in contains an -point subset in convex position. The question is whether, for each fixed , there is a constant such that
for all sufficiently large . Pohoata and Zakharov (2022)
Background
Erdős and Szekeres introduced the planar problem in 1935, proving that a finite threshold exists; in 1960 they established the lower bound and conjectured that their construction was optimal. In higher dimensions the threshold also exists, by a Ramsey-theoretic argument, but that gives comparatively weak quantitative bounds. Whether the three-dimensional numbers might be substantially smaller than the planar ones had been debated, with conflicting predictions. Morris and Soltan conjectured an exponential-scale lower bound in every dimension, a prediction contradicted by the result below. Pohoata and Zakharov (2022)
References
C. Pohoata and D. Zakharov, Convex polytopes from fewer points, arXiv:2208.04878 (2022).
Source: C. Pohoata and D. Zakharov, Convex polytopes from fewer points, arXiv:2208.04878 (2022).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.