The duality conjecture for covering numbers
Statement
Let and be symmetric convex bodies in , and let be the covering number: the least number of translates of needed to cover . For a symmetric convex body , write for its polar body.
Covering-number duality conjecture. There are universal constants such that, for every dimension and every pair of symmetric convex bodies ,
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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.