Papers
Topics
Authors
Recent
Search
2000 character limit reached

On Algorithmic Universality in F-theory Compactifications

Published 7 Jun 2017 in hep-th and hep-ph | (1706.02299v1)

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 $\frac43 \times 2.96 \times 10{755}$ 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 $1-1.01\times 10{-755}$, and the geometric gauge group rank is above $160$ with probability $.999995$. In the latter case there are at least $10$ $E_8$ factors, the structure of which fixes the gauge groups on certain nearby seven-branes. Visible sectors may arise from $E_6$ or $SU(3)$ seven-branes, which occur in certain random samples with probability $\simeq 1/200$.

Citations (62)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.