Javascript must be enabled to continue!
Revisiting the refined Distance Conjecture
View through CrossRef
Abstract
The Distance Conjecture of Ooguri and Vafa holds that any infinite-distance limit in the moduli space of a quantum gravity theory must be accompanied by a tower of exponentially light particles, which places tight constraints on the low-energy effective field theories in these limits. One attempt to extend these constraints to the interior of moduli space is the refined Distance Conjecture, which holds that the towers of light particles predicted by the Distance Conjecture must appear any time a modulus makes a super-Planckian excursion in moduli space. In this note, however, we point out that a tower which satisfies the Distance Conjecture in an infinite-distance limit of moduli space may be parametrically heavier than the Planck scale for an arbitrarily long geodesic distance. This means that the refined Distance Conjecture, in its most naive form, does not place meaningful constraints on low-energy effective field theory. This motivates alternative refinements of the Distance Conjecture, which place an absolute upper bound on the tower mass scale in the interior of moduli space. We explore two possibilities, providing evidence for them and briefly discussing their implications.
Title: Revisiting the refined Distance Conjecture
Description:
Abstract
The Distance Conjecture of Ooguri and Vafa holds that any infinite-distance limit in the moduli space of a quantum gravity theory must be accompanied by a tower of exponentially light particles, which places tight constraints on the low-energy effective field theories in these limits.
One attempt to extend these constraints to the interior of moduli space is the refined Distance Conjecture, which holds that the towers of light particles predicted by the Distance Conjecture must appear any time a modulus makes a super-Planckian excursion in moduli space.
In this note, however, we point out that a tower which satisfies the Distance Conjecture in an infinite-distance limit of moduli space may be parametrically heavier than the Planck scale for an arbitrarily long geodesic distance.
This means that the refined Distance Conjecture, in its most naive form, does not place meaningful constraints on low-energy effective field theory.
This motivates alternative refinements of the Distance Conjecture, which place an absolute upper bound on the tower mass scale in the interior of moduli space.
We explore two possibilities, providing evidence for them and briefly discussing their implications.
Related Results
Étude de la conjecture de Seymour sur le second voisinage
Étude de la conjecture de Seymour sur le second voisinage
Soit D un digraphe simple (sans cycle orienté de longueur 2 ). En 1990, P. Seymour a conjecturé que D a un sommet v avec un second voisinage extérieur au moins aussi grand que son ...
Borel Conjecture, dual Borel Conjecture, and other variants of the Borel Conjecture
Borel Conjecture, dual Borel Conjecture, and other variants of the Borel Conjecture
This survey article is about the Borel Conjecture and several variants (which are inspired by the Galvin-Mycielski-Solovay characterization of strong measure zero) such as the dual...
Rosenfeld’s conjecture
Rosenfeld’s conjecture
Conjecture de rosenfeld
Ma thèse de Doctorat est basée sur un sujet très intéressant en Théorie de Graphe : Le tournoi.En 1934, Rédei a prouvé que tout tournoi cont...
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
In a previous work, we stated a conjecture, called the Galois Brumer–Stark conjecture, that generalizes the (abelian) Brumer–Stark conjecture to Galois extensions. We also proved t...
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Chemins orientés dans les graphes orientés et coloration S-packing des graphes subcubiques
Cette thèse de doctorat est divisée en deux parties principales: La parti...
A Note on Alon–Tarsi Shortest Cycle Cover Conjecture
A Note on Alon–Tarsi Shortest Cycle Cover Conjecture
ABSTRACT
The shortest cycle cover conjecture (SCC conjecture), proposed by Alon and Tarsi, asserts that every bridgeless cubic graph has a cycle cover with a tot...
The Complexity of Mathematics
The Complexity of Mathematics
The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the s...
Distance Learning Overview
Distance Learning Overview
The knowledge explosion, the increased complexity of human life, and the ubiquitous nature of technology coupled with the globalization of the marketplace herald the need to embrac...

