2000 character limit reached
Higher symplectic capacities (1902.01490v4)
Published 4 Feb 2019 in math.SG, math-ph, and math.MP
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.