A Generalized Isoperimetric Inequality via Thick Embeddings of Graphs
Elia Portnoy

TL;DR
This paper establishes a generalized isoperimetric inequality using thick embeddings of graphs, demonstrating the existence of low-dilation maps in higher dimensions and providing a counterexample in dimension 3.
Contribution
It introduces a new isoperimetric inequality based on $k$-dilation, linking it to thick embeddings of graphs and extending classical results to higher dimensions.
Findings
Existence of degree 1 maps with bounded $(n-1)$-dilation in dimensions ≥ 4
Counterexample showing such maps cannot exist in dimension 3
Reduction of the inequality to a graph embedding problem using Kolmogorov-Barzdin theorem
Abstract
We prove a generalized isoperimetric inequality for a domain diffeomorphic to a sphere that replaces filling volume with -dilation. Suppose is an open set in diffeomorphic to a Euclidean -ball. We show that in dimensions at least 4 there is a map from a standard Euclidean ball of radius about to , with degree 1 on the boundary, and -dilation bounded by some constant only depending on . We also give an example in dimension 3 of an open set where no such map with small -dilation can be found. The generalized isoperimetric inequality is reduced to a theorem about thick embeddings of graphs which is proved using the Kolmogorov-Barzdin theorem and the max-flow min-cut theorem. The proof of the counterexample in dimension 3 relies on the coarea inequality and a short winding number computation.
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
TopicsAdvanced Mathematical Modeling in Engineering · Point processes and geometric inequalities · Mathematical Dynamics and Fractals
