Symplectic embeddings of four-dimensional polydisks into balls

We obtain new obstructions to symplectic embeddings of the four-dimensional polydisk P (a , 1) into the ball B(c) for 2 <= a <= (root 7- 1)1(root 7- 2) approximate to 2.549, extending work done by Hind and Lisi and by 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 (2016). We also observe that the computational complexity of this criterion can be reduced from O(2(n)) to O(n(2)).