Work

Computing the EHZ capacity is NP-hard

Year: 2024

Type: article

Abstract: The Ekeland–Hofer–Zehnder capacity (EHZ capacity) is a fundamental symplectic invariant of convex bodies. We show that computing the EHZ capacity of polytopes is N P NP -hard. For this we reduce the feedback arc set problem in bipartite tournaments to computing the EHZ capacity of simplices.

Source: Proceedings of the American Mathematical Society Series B

DOI: 10.1090/bproc/250

Authors: Karla Leipold, Frank Vallentin

Institution: University of Cologne

Language: English

Topic: Geometric and Algebraic Topology

Subfield: Geometry and Topology

Field: Mathematics

Domain: Physical Sciences

Open Access status: gold

Estimated APC paid: $750

Funder: Deutsche Forschungsgemeinschaft