Papers
Topics
Authors
Recent
Search
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.

Authors (1)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.