A discrete view of Gromov's filling area conjecture

TL;DR

This paper introduces a discrete analogue of Gromov's filling area conjecture, providing asymptotic bounds and translating these results to establish a quantitative lower bound on the surface area of isometric fillings of a circle.

Contribution

It formulates a discrete version of Gromov's conjecture, derives asymptotic bounds using graph theory, and applies these to obtain the first quantitative lower bound for arbitrary isometric fillings.

Findings

Discrete bounds derived using graph-theoretic tools

Quantitative lower bound of 1.36π on surface area for isometric fillings

Connection established between discrete bounds and continuous Gromov's problem

Abstract

A compact metric surface $M$ isometrically fills a closed metric curve $C$ if $\partial M=C$ and $d_M(x,y)=d_C(x,y)$ for every $x,y\in C=\partial M$; that is, $M$ does not introduce any ``shortcuts'' between points on its boundary. Gromov's filling area conjecture in differential geometry from 1983 asserts that among all compact, orientable Riemannian surfaces which isometrically fill the Riemannian circle, the one with the smallest surface area is the hemisphere. Gromov demonstrated that this is indeed the case if $M$ is homeomorphic to the disk. While Gromov's conjecture has since been verified in some other cases, the full conjecture remains unresolved. In this paper, we consider a discrete analogue of Gromov's problem, which is likely natural to those who study graph embeddings on arbitrary surfaces. Using standard graph-theoretic tools, such as Menger's theorem, we obtain reasonable asymptotic bounds on this discrete variant. We then demonstrate how these discrete bounds can be translated to the continuous setting, showing that any isometric filling of the Riemannian circle of length $2\pi$ has surface area at least $1.36\pi$ (the hemisphere has surface area $2\pi$). This appears to be the first quantitative lower-bound on Gromov's problem that applies to arbitrary isometric fillings.