Tverberg's theorem states that, for integers and
, every set
of
points in
has a set partition into
nonempty parts whose convex hulls
have a common point (Tverberg 1966). Such a set partition
is called a Tverberg partition. The number of points is best possible.
For , the theorem reduces to Radon's
theorem. Sierksma's conjecture asks for
the stronger conclusion that at least
different unordered Tverberg partitions exist, where
denotes a factorial
(Bárány and Soberón 2018).