Markov staircases
Nikolas Adaloglou, Joé Brendel, Jonny Evans, Johannes Hauber, Felix Schlenk
TL;DR
<3-5 sentence high-level summary>The paper investigates symplectic embeddings of pin-ellipsoids E_{p,q}(\alpha,\beta) into CP^2, showing that for each Markov triple (p, p_2, p_3) with a companion q the embedding problem exhibits an infinite staircase structure governed by Markov mutations. The authors develop a robust framework using almost toric geometry, Vianna triangles, and pavilion blow-ups to translate embedding questions into combinatorial and holomorphic constraints, proving an isotopy theorem, constructing visible staircases, and establishing sharp two-ball packing inequalities. Central to the approach is a Hamiltonian-isotopy–based isotopy result and a non-orbifold proof of Evans–Smith type obstructions, together with a detailed analysis of regulation and broken rulings on pavilion blow-ups. These results connect Markov-number theory with symplectic embedding problems, providing explicit, geometry-driven obstructions and constructions and advancing understanding of how complex-analytic data control four-dimensional symplectic capacities and packings.
Abstract
Rational homology ellipsoids are certain Liouville domains diffeomorphic to rational homology balls and having Lagrangian pin-wheels as their skeleta. From the point of view of almost toric fibrations, they are a natural generalisation of usual symplectic ellipsoids. We study symplectic embeddings of rational homology ellipsoids into the complex projective plane and we show that for each Markov triple, this problem gives rise to an infinite staircase. A key ingredient in the proof is the result that any two such embeddings are Hamiltonian isotopic. We also prove constraints on sizes for pairs of disjoint embeddings.
