ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let B(n)B(n) be the maximum, over all norms on Rn\mathbb{R}^n, of the Borsuk number of (Rn,∥⋅∥)(\mathbb{R}^n,\left\Vert\cdot\right\Vert), where the Borsuk number is the smallest number of sets of strictly smaller diameter needed to partition every bounded subset. Normed-space Borsuk conjecture. For each integer n≥3n\geq 3,

B(n)=2n.B(n)=2^n.

This conjecture is motivated by the inequality bX(K)≤c(K)b_X(K)\leq c(K) and Hadwiger's covering conjecture, which predicts the bound c(K)≤2nc(K)\leq 2^n for convex bodies. Despite progress, it remains open when n≥3n\geq 3.

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.