English

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

Symplectic Geometry 2020-01-24 v1

Abstract

We study the symplectic embedding capacity function CβC_{\beta} for ellipsoids E(1,α)R4E(1,\alpha)\subset R^4 into dilates of polydisks P(1,β)P(1,\beta) as both α\alpha and β\beta vary through [1,)[1,\infty). For β=1\beta=1 Frenkel and Mueller showed that CβC_{\beta} has an infinite staircase accumulating at α=3+22\alpha=3+2\sqrt{2}, while for integer β2\beta\geq 2 Cristofaro-Gardiner, Frenkel, and Schlenk found that no infinite staircase arises. We show that, for arbitrary β(1,)\beta\in (1,\infty), the restriction of CβC_{\beta} to [1,3+22][1,3+2\sqrt{2}] is determined entirely by the obstructions from Frenkel and Mueller's work, leading CβC_{\beta} on this interval to have a finite staircase with the number of steps tending to \infty as β1\beta\to 1. On the other hand, in contrast to the case of integer β\beta, 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}.

Keywords

Cite

@article{arxiv.1801.06762,
  title  = {Infinite staircases in the symplectic embedding problem for four-dimensional ellipsoids into polydisks},
  author = {Michael Usher},
  journal= {arXiv preprint arXiv:1801.06762},
  year   = {2020}
}

Comments

72 pages, 9 figures