How large can the expectation of x be?
Statement
How large can the expectation of x be? The question is the following: Question 1. For what values of k is Dk contractible for every point set P of size n? Note that D1 is just the convex hull of P , which is of course contractible. On the other hand, the set of Tverberg points is in general not even connected, so Dk n is generally not connected for k \geq d+1 (and is of course empty for large k). In R2 it is not hard to show that Dk is convex and thus contractible for k \leq ⌊ n3 ⌋. Problem 6 (Raphael Steiner). This problem was asked by Pavel Valtr at another workshop, and I (Raphael Steiner) am only restating it. Does there exist an absolute constant c \in N such that for every d \in N the hypercube graph Qd admits a topological drawing in the plane such that there exists no collection of c pairwise crossing edges? This relates to another open question, namely whether the maximum number of edges in an n-vertex k-quasi-planar graph is bounded linearly in n. Problem 7 (Dima Zakharov). Let n \geq k \geq 2 and A \subset S n be a measurable subset which does not contain k pairwise orthogonal vectors. Show that µ(A) . e−cn/k for some c > 0. A double cap construction shows that this would be best possible. \sqrt{ } We know this only in the special cases
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.