Checking the Convex Hull Weak Gravity Conjecture by explicitly constructing the charge-to-mass convex hull has worst-case runtime exponential in the number of U(1) gauge fields, but the paper also claims a polynomial shortcut that may be flawed.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
hep-th 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
The Computational Complexity of the Weak Gravity Conjecture
Checking the Convex Hull Weak Gravity Conjecture by explicitly constructing the charge-to-mass convex hull has worst-case runtime exponential in the number of U(1) gauge fields, but the paper also claims a polynomial shortcut that may be flawed.