A local systolic inequality and Gromov's filling area conjecture
Olaf M\"uller

TL;DR
This paper investigates Gromov's filling area conjecture, aiming to establish volume bounds and a local systolic inequality, but contains a computational error in its proof of the latter.
Contribution
It attempts to prove a local systolic inequality and volume bounds related to Gromov's conjecture, highlighting the challenges in such geometric inequalities.
Findings
Proposed that fillings with volume less than 2π are unattainable
Attempted to establish a lower volume estimate via a local systolic inequality
Identified a computational mistake in the proof of the systolic inequality
Abstract
The article treats some questions around Gromov's filling area conjecture. It intended to show that any filling with volume would not be attained and to show a local systolic inequality, implying an a priori lower estimate on the total volume. The proof of both assertions, the second of which is wrong, suffered from a computational mistake.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematics and Applications · Point processes and geometric inequalities · Geometric and Algebraic Topology
