On Algorithmic Universality in F-theory Compactifications
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 .
Cite
@article{arxiv.1706.02299,
title = {On Algorithmic Universality in F-theory Compactifications},
author = {James Halverson and Cody Long and Benjamin Sung},
journal= {arXiv preprint arXiv:1706.02299},
year = {2017}
}
Comments
6 pages, 5 figures