2000 character limit reached
Coarse distance from dynamically convex to convex
Published 12 Aug 2023 in math.SG and math.DS | (2308.06604v2)
Abstract: Chaidez and Edtmair have recently found the first example of dynamically convex domains in $\mathbb R4$ that are not symplectomorphic to convex domains (called symplectically convex domains), answering a long-standing open question. In this paper, we discover new examples of such domains without referring to Chaidez-Edtmair's criterion. We also show that these domains are arbitrarily far from the set of symplectically convex domains in $\mathbb R4$ with respect to the coarse symplectic Banach-Mazur distance by using an explicit numerical criterion for symplectic non-convexity.
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.