On Algorithmic Universality in F-theory Compactifications
arXiv:1706.02299 · doi:10.1103/PhysRevD.96.126006
Abstract
We study universality of geometric gauge sectors in the string landscape in the context of F-theory compactifications. A finite time construction algorithm is presented for F-theory geometries that are connected by a network of topological transitions in a connected moduli space. High probability geometric assumptions uncover universal structures in the ensemble without explicitly constructing it. For example, non-Higgsable clusters of seven-branes with intricate gauge sectors occur with probability above , and the geometric gauge group rank is above with probability . In the latter case there are at least factors, the structure of which fixes the gauge groups on certain nearby seven-branes. Visible sectors may arise from or seven-branes, which occur in certain random samples with probability .
6 pages, 5 figures
References in corpus (6)
- Computational complexity of the landscape I
- String Theory and the Dark Glueball Problem
- Calabi-Yau threefolds with large h^{2, 1}
- The Vertical, the Horizontal and the Rest: anatomy of the middle cohomology of Calabi-Yau fourfolds and F-theory applications
- Non-Higgsable QCD and the Standard Model Spectrum in F-theory
- The Cost of Seven-brane Gauge Symmetry in a Quadrillion F-theory Compactifications