ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let CnC_n be the cycle graph on nn vertices, and let D(n;ϵ)D(n;\epsilon) denote the minimum number of vertices in a (1−ϵ)(1-\epsilon)-Lipschitz filling of CnC_n. Define

D∗=deflim inf⁡ϵ→0+lim inf⁡n→∞D(n;ϵ)n2.D^*\stackrel{\text{def}}{=}\liminf_{\epsilon\to 0^+}\liminf_{n\to\infty}\frac{D(n;\epsilon)}{n^2}.

The discrete filling-area density conjecture.

D∗<1π3.D^*<\frac{1}{\pi\sqrt{3}}.

The paper's bounds show that D∗≤1/(π3)D^*\leq 1/(\pi\sqrt{3}) 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 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.