ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let KK and LL be symmetric convex bodies in Rn\mathbb R^n, and let N(K,L)N(K,L) be the covering number: the least number of translates of LL needed to cover KK. For a symmetric convex body KK, write K∗K^* for its polar body.

Covering-number duality conjecture. There are universal constants c,C>0c,C>0 such that, for every dimension nn and every pair of symmetric convex bodies K,L⊂RnK,L\subset\mathbb R^n,

N(K,L)≤N(L∗,cK∗)C.N(K,L)\leq N(L^*,cK^*)^C.

This is presented as an open problem in geometric analysis. It proposes a dimension-free comparison between a covering number and the covering number of the corresponding polar bodies.

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.