Sierksma’s conjecture
For every pair of integers and , every affine map has at least unordered partitions of the vertex set of into nonempty parts such that .
Equivalent formulations
Every set of points in has at least unordered partitions into parts whose convex hulls have a common point.
References
- The number of Tverberg partitions beyond prime powers — arXiv — Matija Blagojević, Pavle V. M. Blagojević
Source: arXiv
Progress summary
An unrefereed preprint reports a weaker lower bound for the number of partitions, but the conjectured bound remains unproved.
Sierksma’s conjecture says that every set of points in has at least unordered Tverberg partitions. It remains open in general.
Known results
- Hell, 2008: proved the case , , giving at least partitions.
- Vučić–Živaljević and Hell: established weaker lower bounds when is a prime power.
- The case is settled for arbitrary .
- The conjectured bound is sharp for known extremal configurations, but its universal validity is unproved.
October 2026 lower-bound preprint
Blagojević and Blagojević claim an explicit lower bound involving a prime-power component of , extending quantitative results beyond the prime-power regime. The bound is weaker than in general, so this is claimed progress rather than a resolution; the preprint is unrefereed.
Current status (as of October 2026): The conjecture is settled for and for , ; the general bound remains open, with a weaker non-prime-power lower bound claimed in an unrefereed preprint.
Solutions 0
No solutions have been posted yet.