Higher symplectic capacities
Kyler Siegel
TL;DR
This work develops a novel framework of higher symplectic capacities built from rational SFT, using filtered L_infty algebras on linearized contact homology to count punctured curves with geometric constraints. By encoding point constraints, tangencies, and blowups into RSFT augmentations, the authors construct dimensionally stable capacities g_b and their refinements, proving monotonicity, stabilization, and links to closed-curve GW data. They obtain concrete computations for balls, ellipsoids, and polydisks that yield sharp obstructions in stabilized embedding problems, and they introduce broader families r_b from the full contact homology algebra to capture additional obstructions. Collectively, these capacities provide a sharp, algebraically grounded toolkit for high-dimensional symplectic embedding problems and unify several prior obstruction methods under RSFT, paving the way for a complete obstruction program in stabilization questions. The approach offers a principled way to translate intricate curve counts into quantitative embedding constraints with potential for algorithmic computation in convex toric and related domains.
Abstract
We construct new families of symplectic capacities indexed by certain symmetric polynomials, defined using rational symplectic field theory. In particular, we introduce a sequence of capacities based on an L-infinity structure on linearized contact homology and rational curve counts with local tangency constraints. We prove various structural properties of these capacities and give some preliminary computations which show that they give state of the art symplectic embedding obstructions in basic examples.
