A partition theorem of Tverberg-type for boxes in \(R^3\) (Q5951941)

Radon's theorem is the special case \(m = 2\) of Tverberg's partition theorem [\textit{H. Tverberg}, J. Lond. Math. Soc. 41, 123-128 (1966; Zbl 0131.20002)]: Every \((m(d + 1)- d)\)-set in \(\mathbb{R}^d\) can be partitioned into \(m\) subsets whose convex hulls have a nonempty intersection.NEWLINENEWLINENEWLINEHere the author considers the variant where convex hulls are replaced by box hulls: The box hull of a finite set \(S\) in \(\mathbb{R}^d\) is the smallest parallelotope with edges parallel to the coordinate axes which contains \(S\). Let \(r_m(d)\) be the smallest integer \(n\) such that any \(n\)-set in \(\mathbb{R}^d\) can be partitioned into \(m\) subsets whose box hulls have a non-empty intersection. For \(d > 3\) and \(m > 24\) the problem of finding \(r_m(d)\) is wide open. Here the author deals with the case \(d = 3\) and proves that \(\lfloor\frac 52 m\rfloor\leq r_m(3)\leq \lfloor\frac{18}{7} m\rfloor\). The lower bound had been stated (without proof) by Hare and Thompson. It is not always sharp: Eckhoff proves that \(r_9(3) = 23\) and claims that the same construction yields \(r_{11}(3) = 28\), \(r_{13}(3)= 33\), \(r_{15}(3)=38\), \(r_{19}(3) = 48\), and \(r_{21}(3) = 53\), but the argument becomes increasingly involved.NEWLINENEWLINENEWLINEThe method of proof consists of reducing the geometrical problem to a purely combinatorial problem on systems of permutations.