Infinite staircases in the symplectic embedding problem for four-dimensional ellipsoids into polydisks

preprint2018arXivOpen access

Abstract

We study the symplectic embedding capacity function CβC_β for ellipsoids E(1,α)⊂R4E(1,α)\subset R^4 into dilates of polydisks P(1,β)P(1,β) as both αα and ββ vary through [1,∞)[1,\infty). For β=1β=1 Frenkel and Mueller showed that CβC_β has an infinite staircase accumulating at α=3+22α=3+2\sqrt{2}, while for integer β≥2β\geq 2 Cristofaro-Gardiner, Frenkel, and Schlenk found that no infinite staircase arises. We show that, for arbitrary β∈(1,∞)β\in (1,\infty), the restriction of CβC_β to [1,3+22][1,3+2\sqrt{2}] is determined entirely by the obstructions from Frenkel and Mueller's work, leading CβC_β on this interval to have a finite staircase with the number of steps tending to ∞\infty as β→1β\to 1. On the other hand, in contrast to the case of integer ββ, for a certain doubly-indexed sequence of irrational numbers Ln,kL_{n,k} we find that CLn,kC_{L_{n,k}} has an infinite staircase; these Ln,kL_{n,k} include both numbers that are arbitrarily large and numbers that are arbitrarily close to 11, with the corresponding accumulation points respectively arbitrarily large and arbitrarily close to 3+223+2\sqrt{2}.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.