The discrete filling-area density conjecture
Statement
Let be the cycle graph on vertices, and let denote the minimum number of vertices in a -Lipschitz filling of . Define
The discrete filling-area density conjecture.
The paper's bounds show that and that the strict inequality would separate the discrete problem from Gromov's continuous filling-area conjecture. The authors believe the strict inequality strongly, but do not provide a construction proving it.
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.