Symplectic embeddings of four-dimensional polydisks into balls
Abstract
In this paper we obtain new obstructions to symplectic embeddings of the four-dimensional polydisk P(a,1) into the ball B(c) for 2≤ a<7-1 7-2 ≈ 2.549, extending work done by Hind-Lisi and Hutchings. Schlenk's folding construction permits us to conclude our bound on c is optimal. Our proof makes use of the combinatorial criterion necessary for one "convex toric domain" to symplectically embed into another introduced by Hutchings in Beyond. Additionally, we prove that if certain symplectic embeddings of four dimensional convex toric domains exist then a modified version of this criterion from Beyond must hold, thereby reducing the computational complexity of the original criterion from O(2n) to O(n2).
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.