For integers d\geq 1 and r\geq 2, determine the least n such that every affine map f from the simplex \Delta^{n-1} to \mathbb{R}^{d}, with its vertices partitioned into d+1…
Statement
For integers d\geq 1 and r\geq 2, determine the least n such that every affine map f from the simplex \Delta^{n-1} to \mathbb{R}^{d}, with its vertices partitioned into d+1 color classes each of size at least r, admits r pairwise disjoint rainbow faces whose images have a common point; is the Bárány--Larman conjecture n(d,r)=(d+1)r true? In the alternative colored Tverberg problem, determine the least t such that the analogous assertion holds for equal color classes of size t, equivalently, whether t(d,r)=r.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.