May 14, 2024
We implement Genetic Algorithms for triangulations of four-dimensional reflexive polytopes which induce Calabi-Yau threefold hypersurfaces via Batryev's construction. We demonstrate that such algorithms efficiently optimize physical observables such as axion decay constants or axion-photon couplings in string theory compactifications. For our implementation, we choose a parameterization of triangulations that yields homotopy inequivalent Calabi-Yau threefolds by extending fine, regular triangulations of two-faces, thereby eliminating exponentially large redundancy factors in the map from polytope triangulations to Calabi-Yau hypersurfaces. In particular, we discuss how this encoding renders the entire Kreuzer-Skarke list amenable to a variety of optimization strategies, including but not limited to Genetic Algorithms. To achieve optimal performance, we tune the hyperparameters of our Genetic Algorithm using Bayesian optimization. We find that our implementation vastly outperforms other sampling and optimization strategies like Markov Chain Monte Carlo or Simulated Annealing. Finally, we showcase that our Genetic Algorithm efficiently performs optimization even for the maximal polytope with Hodge numbers $h^{1,1} = 491$, where we use it to maximize axion-photon couplings.
Similar papers 1
June 9, 2023
Calabi-Yau manifolds can be obtained as hypersurfaces in toric varieties built from reflexive polytopes. We generate reflexive polytopes in various dimensions using a genetic algorithm. As a proof of principle, we demonstrate that our algorithm reproduces the full set of reflexive polytopes in two and three dimensions, and in four dimensions with a small number of vertices and points. Motivated by this result, we construct five-dimensional reflexive polytopes with the lowest ...
August 4, 2020
We study Calabi-Yau threefolds with large Hodge numbers by constructing and counting triangulations of reflexive polytopes. By counting points in the associated secondary polytopes, we show that the number of fine, regular, star triangulations of polytopes in the Kreuzer-Skarke list is bounded above by $\binom{14,111}{494} \approx 10^{928}$. Adapting a result of Anclin on triangulations of lattice polygons, we obtain a bound on the number of triangulations of each 2-face of e...
November 14, 2021
We investigate reinforcement learning and genetic algorithms in the context of heterotic Calabi-Yau models with monad bundles. Both methods are found to be highly efficient in identifying phenomenologically attractive three-family models, in cases where systematic scans are not feasible. For monads on the bi-cubic Calabi-Yau either method facilitates a complete search of the environment and leads to similar sets of previously unknown three-family models.
November 5, 2014
Kreuzer and Skarke famously produced the largest known database of Calabi-Yau threefolds by providing a complete construction of all 473,800,776 reflexive polyhedra that exist in four dimensions. These polyhedra describe the singular limits of ambient toric varieties in which Calabi-Yau threefolds can exist as hypersurfaces. In this paper, we review how to extract topological and geometric information about Calabi-Yau threefolds using the toric construction, and we provide, i...
August 3, 2018
We study the topological properties of Calabi-Yau threefold hypersurfaces at large $h^{1,1}$. We obtain two million threefolds $X$ by triangulating polytopes from the Kreuzer-Skarke list, including all polytopes with $240 \le h^{1,1}\le 491$. We show that the K\"ahler cone of $X$ is very narrow at large $h^{1,1}$, and as a consequence, control of the $\alpha^{\prime}$ expansion in string compactifications on $X$ is correlated with the presence of ultralight axions. If every e...
June 5, 2023
The string theory landscape may include a multitude of ultraviolet embeddings of the Standard Model, but identifying these has proven difficult due to the enormous number of available string compactifications. Genetic Algorithms (GAs) represent a powerful class of discrete optimisation techniques that can efficiently deal with the immensity of the string landscape, especially when enhanced with input from quantum annealers. In this letter we focus on geometric compactificatio...
November 15, 2018
We provide the first estimate of the number of fine, regular, star triangulations of the four-dimensional reflexive polytopes, as classified by Kreuzer and Skarke (KS). This provides an upper bound on the number of Calabi-Yau threefold hypersurfaces in toric varieties. The estimate is performed with deep learning, specifically the novel equation learner (EQL) architecture. We demonstrate that EQL networks accurately predict numbers of triangulations far beyond the $h^{1,1}$ t...
August 1, 2013
With a bird's-eye view, we survey the landscape of Calabi-Yau threefolds, compact and non-compact, smooth and singular. Emphasis will be placed on the algorithms and databases which have been established over the years, and how they have been useful in the interaction between the physics and the mathematics, especially in string and gauge theories. A skein which runs through this review will be algorithmic and computational algebraic geometry and how, implementing its princip...
October 26, 2021
The immensity of the string landscape and the difficulty of identifying solutions that match the observed features of particle physics have raised serious questions about the predictive power of string theory. Modern methods of optimisation and search can, however, significantly improve the prospects of constructing the standard model in string theory. In this paper we scrutinise a corner of the heterotic string landscape consisting of compactifications on Calabi-Yau three-fo...
September 19, 2023
We present an algorithm for efficiently exploring inequivalent Calabi-Yau threefold hypersurfaces in toric varieties. A direct enumeration of fine, regular, star triangulations (FRSTs) of polytopes in the Kreuzer-Skarke database is foreseeably impossible due to the large count of distinct FRSTs. Moreover, such an enumeration is needlessly redundant because many such triangulations have the same restrictions to 2-faces and hence, by Wall's theorem, lead to equivalent Calabi-Ya...