vix.ing · top · new · best · stats

The Computational Complexity of the Weak Gravity Conjecture

2025/05/06 by Stefano Lanza, Lanza, Stefano
Physics and Astronomy · #Black Holes and Theoretical Physics #FOS: Physical sciences #High Energy Physics - Theory (hep-th) #Noncommutative and Quantum Gravity Theories #Particle physics theoretical and experimental studies

paper · pdf · doi:10.48550/arxiv.2505.03868

openalex publication_date 2025/05/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

The Weak Gravity Conjecture imposes stringent constraints on effective field theories to allow for an ultraviolet completion within quantum gravity. While substantial evidence supports the conjecture across broad classes of string theory-derived effective field theories, constructing low-dimensional models realizing it explicitly remains highly non-trivial. In this work, we illustrate how the presence of multiple gauge fields in an effective field theory significantly complicates the bottom-up implementation of the Weak Gravity Conjecture. To this end, we introduce a general algorithm that constructs the convex hull associated with a given set of superextremal states and verifies whether it satisfies the Convex Hull version of the Weak Gravity Conjecture. We show that the computational time of this construction grows exponentially with the number of gauge fields, thereby revealing a fundamental obstruction to concrete, algorithmic realizations of the conjecture in theories with many gauge fields.

Citations

Related