On certain quantifications of Gromov's non-squeezing theorem
Kevin Sackel, Antoine Song, Umut Varolgunes, Jonathan J. Zhu

TL;DR
This paper investigates the minimal size and dimension of subsets that obstruct symplectic embeddings of Euclidean balls into cylinders, establishing lower bounds on Minkowski dimension and providing explicit examples for optimality.
Contribution
It proves that the Minkowski dimension of the obstruction set must be at least 2, and constructs examples showing this bound is sharp for certain radii, advancing understanding of symplectic embedding obstructions.
Findings
Minkowski dimension of the obstruction set is at least 2.
Explicit examples demonstrate the optimality of the dimension bound for R ≤ √2.
Lower bound on the obstruction set's dimension is also optimal for R < √3.
Abstract
Let and let be the Euclidean -ball of radius with a closed subset removed. Suppose that embeds symplectically into the unit cylinder . By Gromov's non-squeezing theorem, must be non-empty. We prove that the Minkowski dimension of is at least , and we exhibit an explicit example showing that this result is optimal at least for . In an appendix by Jo\'e Brendel, it is shown that the lower bound is optimal for . We also discuss the minimum volume of in the case that the symplectic embedding extends, with bounded Lipschitz constant, to the entire ball.
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
TopicsPoint processes and geometric inequalities · Geometric and Algebraic Topology · Computational Geometry and Mesh Generation
