Constructing and Machine Learning Calabi-Yau Five-folds

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...

We apply machine learning to the problem of finding numerical Calabi-Yau metrics. Building on Donaldson's algorithm for calculating balanced metrics on K\"ahler manifolds, we combine conventional curve fitting and machine-learning techniques to numerically approximate Ricci-flat metrics. We show that machine learning is able to predict the Calabi-Yau metric and quantities associated with it, such as its determinant, having seen only a small sample of training data. Using this...

We propose a machine-learning approach to study topological quantities related to the Sasakian and $G_2$-geometries of contact Calabi-Yau $7$-manifolds. Specifically, we compute datasets for certain Sasakian Hodge numbers and for the Crowley-N\"ordstrom invariant of the natural $G_2$-structure of the $7$-dimensional link of a weighted projective Calabi-Yau $3$-fold hypersurface singularity, for each of the 7555 possible $\mathbb{P}^4(\textbf{w})$ projective spaces. These topo...

We investigate different approaches to machine learning of line bundle cohomology on complex surfaces as well as on Calabi-Yau three-folds. Standard function learning based on simple fully connected networks with logistic sigmoids is reviewed and its main features and shortcomings are discussed. It has been observed recently that line bundle cohomology can be described by dividing the Picard lattice into certain regions in each of which the cohomology dimension is described b...

We use the machine learning technique to search the polytope which can result in an orientifold Calabi-Yau hypersurface and the "naive Type IIB string vacua". We show that neural networks can be trained to give a high accuracy for classifying the orientifold property and vacua based on the newly generated orientifold Calabi-Yau database with $h^{1,1}(X) \leq 6$ arXiv:2111.03078. This indicates the orientifold symmetry may already be encoded in the polytope structure. In the e...

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...

Calabi-Yau links are specific $S^1$-fibrations over Calabi-Yau manifolds, when the link is 7-dimensional they exhibit both Sasakian and G2 structures. In this invited contribution to the DANGER proceedings, previous work exhaustively computing Calabi-Yau links and selected topological properties is summarised. Machine learning of these properties inspires new conjectures about their computation, as well as the respective Gr\"obner bases.

We employ machine learning techniques to investigate the volume minimum of Sasaki-Einstein base manifolds of non-compact toric Calabi-Yau 3-folds. We find that the minimum volume can be approximated via a second order multiple linear regression on standard topological quantities obtained from the corresponding toric diagram. The approximation improves further after invoking a convolutional neural network with the full toric diagram of the Calabi-Yau 3-folds as the input. We a...

We present a generalization of the complete intersection in products of projective space (CICY) construction of Calabi-Yau manifolds. CICY three-folds and four-folds have been studied extensively in the physics literature. Their utility stems from the fact that they can be simply described in terms of a `configuration matrix', a matrix of integers from which many of the details of the geometries can be easily extracted. The generalization we present is to allow negative integ...

We use machine learning to approximate Calabi-Yau and SU(3)-structure metrics, including for the first time complex structure moduli dependence. Our new methods furthermore improve existing numerical approximations in terms of accuracy and speed. Knowing these metrics has numerous applications, ranging from computations of crucial aspects of the effective field theory of string compactifications such as the canonical normalizations for Yukawa couplings, and the massive string...