2000 character limit reached
A contact camel theorem
Published 16 Aug 2018 in math.SG | (1808.05457v1)
Abstract: We provide a contact analogue of the symplectic camel theorem that holds in $\mathbb{R}{2n}\times S1$, and indeed generalize the symplectic camel. Our proof is based on the generating function techniques introduced by Viterbo, extended to the contact case by Bhupal and Sandon, and builds on Viterbo's proof of the symplectic camel.
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.