pith. sign in

arxiv: 1610.00566 · v2 · pith:TH4V727Onew · submitted 2016-10-03 · 🧮 math.SG

Symplectic embeddings of four-dimensional polydisks into balls

classification 🧮 math.SG
keywords criterionembeddingssymplecticbeyondciteconvexfour-dimensionalhutchings
0
0 comments X
read the original 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\leq a<\frac{\sqrt{7}-1} {\sqrt{7}-2} \approx 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 \cite{Beyond}. Additionally, we prove that if certain symplectic embeddings of four dimensional convex toric domains exist then a modified version of this criterion from \cite{Beyond} must hold, thereby reducing the computational complexity of the original criterion from $O(2^n)$ to $O(n^2)$.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.