The Computational Complexity of the Weak Gravity Conjecture

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autore principale: Lanza, Stefano
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866908352284459008
author Lanza, Stefano
author_facet Lanza, Stefano
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2505_03868
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle The Computational Complexity of the Weak Gravity Conjecture
Lanza, Stefano
High Energy Physics - Theory
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.
title The Computational Complexity of the Weak Gravity Conjecture
topic High Energy Physics - Theory
url https://arxiv.org/abs/2505.03868