2000 character limit reached
On the symplectic size of convex polytopes
Published 10 Dec 2017 in math.SG | (1712.03494v3)
Abstract: In this paper we introduce a combinatorial formula for the Ekeland-Hofer-Zehnder capacity of a convex polytope in $\mathbb{R}{2n}$. One application of this formula is a certain subadditivity property of this capacity.
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.
