Pith. sign in

REVIEW 1 cited by

Computing the EHZ capacity is NP-hard

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.09914 v3 pith:JZZACDPE submitted 2024-02-15 math.SG cs.CCmath.CO

Karla Leipold , Frank Vallentin This is my paper
classification math.SGcs.CCmath.CO
keywords capacitycomputingnp-hardbipartitebodiesconvexekeland-hofer-zehnderfeedback
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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 NP-hard. For this we reduce the feedback arc set problem in bipartite tournaments to computing the EHZ capacity of simplices.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An equality for balanced digraphs

    math.CO 2025-07 accept novelty 7.0 of 10

    The number of k-arc acyclic subdigraphs in which every vertex can reach a fixed root is independent of the root, for any balanced digraph.

Pith tools