ProbXiv
Explorersign in
Problem archiveProblem record

Statement

The question is the following: Question 1. 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. What if I have a Riemanian manifold with systole \leq 2? diam Gromov showed that this bound is attained only at RPn . Is the number of topologies for 2 − \varepsilon finite? As shown by Buser Somak, this ratio is infinitely often greater than some c > 0. Problem 5 (Patrick Schnider). Let P be a finite set of n points in Rd (maybe in general position or even in strongly general position). Let q \in Rd be another point. We define the Tverberg depth of q with respect to P , denoted by TvD(P, q), as the maximum k such that there is a partition of P into k pairwise disjoint subsets Tk P1 , . . . , Pk \subset P with i=1 conv(Pi ) 6= \varnothing. In this language, Tverberg’s theorem says n that there is a point q with TvD(P, q) \geq d+1 . Consider the region Dk of points in R that have Tverberg depth at least k, that is, Dk = {q \in Rd | TvD(P, q) \geq k}. d Problem 8 (Xavier Goaoc). Let S be an arbitrary set of n great circles in S2 such that no three have a point in common. Let c be a 2-dimensional cell chosen equiprobably from the arrangement of S. Let S ′ \subset S be the subset of great circles not touching c, and let c′ be the 2-dimensional cell of the arrangement of S ′ that contains c. Let x denote the number of edges of c′ . Note that x is a random variable whose distribution depends on the arrangement of S. How large can the expectation of x be?

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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.