Infinite staircases in the symplectic embedding problem for four-dimensional ellipsoids into polydisks
Abstract
We study the symplectic embedding capacity function for ellipsoids into dilates of polydisks as both and vary through . For Frenkel and Mueller showed that has an infinite staircase accumulating at , while for integer Cristofaro-Gardiner, Frenkel, and Schlenk found that no infinite staircase arises. We show that, for arbitrary , the restriction of to is determined entirely by the obstructions from Frenkel and Mueller's work, leading on this interval to have a finite staircase with the number of steps tending to as . On the other hand, in contrast to the case of integer , for a certain doubly-indexed sequence of irrational numbers we find that has an infinite staircase; these include both numbers that are arbitrarily large and numbers that are arbitrarily close to , with the corresponding accumulation points respectively arbitrarily large and arbitrarily close to .
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