All complete intersection Calabi-Yau four-folds

We present an exhaustive, constructive, classification of the Calabi-Yau four-folds which can be described as complete intersections in products of projective spaces. A comprehensive list of 921,497 configuration matrices which represent all topologically distinct types of complete intersection Calabi-Yau four-folds is provided and can be downloaded here. The manifolds have non-negative Euler characteristics in the range 0 ≤ χ ≤ 2610. This data set will be of use in a wide range of physical and mathematical applications. Nearly all of these four-folds are elliptically fibered and are thus of interest for F-theory model building.


Contents 1 Introduction
Calabi-Yau manifolds play an important role in several branches of mathematics and physics. Often one obstruction to progress in a given area is the lack of large data sets of example manifolds. In this paper, we take a step towards rectifying this situation by explicitly constructing and classifying a specific class of Calabi-Yau four-folds. This set consists of Calabi-Yau four-folds which can be realized as complete intersections in products of complex projective spaces (the CICYs), arguably the simplest construction of Calabi-Yau manifolds available. The data set we find consists of some 921,497 configuration matrices describing these Calabi-Yau four-folds and thus provides a large, explicit and easy to manipulate class of such manifolds.
For Calabi-Yau three-folds, all possible distinct CICYs were classified in 1988 by Candelas et al. [1]. By means of a computer algorithm, a list of 7890 configuration matrices was obtained. This data set has been immensely useful, particularly in the context of string theory, and is still used to this day. For example, more recently, freely-acting symmetries for CICY three-folds have been classified [2] and a large class of heterotic string standard models has been constructed based on these manifolds [3,4]. The main purpose of the present paper is to carry out an analogous classification of CICY four-folds.
Calabi-Yau four-folds are of particular importance for the construction of four-dimensional N = 1 string vacua based on F-theory [5][6][7][8]. If the success of heterotic model building, where the systematic analysis of large classes of vacua has led to the discovery of many standard-like models [3], is to be emulated in F-theory, large, accessible classes of Calabi-Yau four-folds will be required [9]. Moreover, for the application to F-theory, Calabi-Yau four-folds need to allow for an elliptic fibration structure, where the six-dimensional base manifold corresponds to the "physical" space required in the compactification from JHEP07(2013)070 ten to four dimensions and the torus fiber describes the variation of the axio-dilaton over this base space. As we will see, practically all of the CICY four-folds which arise from our classification allow for an elliptic fibration and are, therefore, of potential use for F-theory.
In order to introduce some basic ideas and discuss elementary properties of CICY fourfolds we would like to start with a prototypical example, given by the configuration matrix (1.1) The notation is to be understood as follows. The first column of the matrix denotes the dimensions of the projective spaces whose product forms the ambient space into which the CICY is embedded. Here, this ambient space is P 1 × P 2 × P 3 . Each of the remaining columns denotes the multi-degree of a polynomial in the ambient projective coordinates. For the present example, we have two polynomials with multi-degrees (1, 1, 0) and (1,2,4), where the three entries refer to the degrees in the coordinates of P 1 , P 2 and P 3 , respectively. The CICY defined is the common zero locus of these polynomials. If we denote the P 1 coordinates by x i , where i = 0, 1, the P 2 coordinates by y a , where a = 0, 1, 2 and the P 3 coordinates by z α , where α = 0, . . . , 3, then these polynomials can be written as where c ia and d iabαβγδ are complex coefficients. Hence, the configuration matrix (1.1) describes a family of CICYs parametrized by the space of coefficients in these polynomials. Fortunately, many of the basic properties, such as the Euler characteristic, do not depend on the specific choice of these coefficients but only on the configuration matrix. This feature is of course one of the strengths of the configuration notation and one of the main motivations for its introduction. For the purpose of applications to F-theory, how do we identify the existence of an elliptic fibration structure for such a CICY four-fold? In fact, the configuration matrix (1.1) represents an example of a CICY with an "obvious" elliptic fibration, that is, a fibration which is consistent with the projective ambient space embedding. To see this we note that the first two rows of the configuration matrix (1.1) are given by and represent a Calabi-Yau one-fold, that is, a torus T 2 . The full configuration (1.1) describes a CICY where this torus is fibered over the base space P 3 . It turns out that this fibration has section. As we will show, all but 477 of our 921,497 CICY configuration matrices have an elliptic fibration of this kind, consistent with the projective embedding. Indeed, many of these have a large number of different such fibrations, many of them with sections. This means the number of physical F-theory compactifications which can be obtained from this data set is, in fact, much larger than 921,497.

JHEP07(2013)070
Our approach for classifying CICY four-folds will broadly follow the algorithm for the classification of CICY three-folds set out in ref. [1]. However, the large scope of the project, reflected in the total number of configuration matrices and their maximal size, means that numerous efficiency improvements had to be made in order to complete the task in a reasonable amount of computing time. Moreover, some of the methods do not generalize from three-to four-folds and had to be modified appropriately. As an example, we mention the operation on configuration matrices referred to as "splitting". It involves increasing the size of the configuration by breaking up a column of the original matrix into several summands and adding a P n factor to the ambient space. A crucial step in the classification algorithm is to decide whether or not a splitting is effective, that is, whether it leads to a topologically different manifold. Unfortunately, the effectiveness criterion for CICY three-folds developed in ref. [1] does not generalize to four-folds and a new criterion had to be found. The details of the classification algorithm, including an effectiveness criterion for four-fold splittings, and the main results of the classification will be described in the remainder of this paper. In a longer, companion paper to this article [10], we will provide additional properties of the manifolds in this data set. This will include information on Hodge numbers, Chern classes, and the structure of elliptic fibrations and sections.
The paper is organized as follows. In the next section, we define the data set we will be studying in more detail and explain why a finite number of configuration matrices suffices to represent all CICY four-folds. Essentially, different configuration matrices can describe the same Calabi-Yau manifold, and all CICY four-folds are accounted for by a finite subset of the infinite number of possible configuration matrices. We obtain upper bounds on the size of the matrices that need be considered and provide a table of all possible ambient spaces that can occur in this finite list. To classify the different manifolds it is useful to compute the Euler characteristic χ, which only depends on the configuration matrix. The formula for χ together with expressions for the Chern classes are introduced in section 3. In section 4 different types of possible equivalences, which have been taken into account in the compilation of our list, are discussed. It is explained how they generalize known results for three-folds to four-folds and how they can be dealt with efficiently. In section 5, we describe in detail the algorithm that was used to compile our list. The results of running this algorithm are presented in section 6. We provide a histogram of the different values for the Euler characteristic that occur in the list, discuss the question of how many topologically distinct manifolds are present and how many manifolds have an obvious fibration structure. We conclude in section 7.

Definitions and finiteness of the class
We begin with a general description of the CICY four-folds classified in this paper. Our notation and conventions largely follow the original papers on CICY three-folds [1,[11][12][13] and ref. [14]. We consider the complete intersection of K polynomials p α in a product of m projective spaces P n 1 × · · · × P nm of total dimension K + 4 = m r=1 n r . In the following, we use indices r, s, . . . = 1, . . . , m to label the projective ambient space factors P nr and indices α, β, · · · = 1, . . . , K to label the polynomials p α . Such manifolds are described by a with non-negative integer entries q r α . The columns q α = (q r α ) r=1,...,m of this matrix denote the multi-degrees of the defining polynomials p α . More precisely, the polynomial p α is of degree q r α in x r,i , the homogeneous coordinates of P nr . In order to ensure that this prescription defines a four-dimensional manifold, we demand that the K-form dp 1 ∧ · · · ∧ dp K (2.2) is nowhere vanishing. The configuration [n|q] describes a family of CICYs redundantly parametrized by the space of coefficients in the polynomials p α . The strength of this notation rests on the fact that key properties of the manifolds defined in this way only depend on the configuration matrix and not on the specific choice of polynomial coefficients. Moreover, it was shown in ref. [12] that for every configuration a generic choice of coefficients defines a complete intersection manifold. In the following, we will not distinguish between the family [n|q] and a specific member thereof.
In order for a configuration matrix (2.1) to define Calabi-Yau manifolds we must ensure the vanishing of the first Chern class which is equivalent to the conditions K α=1 q r α = n r + 1 (2.3) on each row of the configuration matrix. The conditions on CICY configuration matrices stated so far are not particularly stringent and it is clear that the set of such matrices is infinite. However, different configuration matrices can describe the same Calabi-Yau four-fold. In order to arrive at a finite list classifying all topological types of CICY four-folds, we need to identify suitable equivalence relations between configurations and only keep one representative per class.
The simplest example of such an equivalence relation stems from the following observation. The ordering of ambient space factors and polynomials in the configuration matrix is completely arbitrary. Therefore, two configuration matrices that differ only by permutations of rows or columns describe the same family of CICY four-folds. To reduce the occurrence of such permutations we will, in our algorithm, impose a lexicographic order (with the entries q r α = 0, 1, 2, . . . ordered by value) on the rows and columns [1]. It then suffices to consider only permutations of rows where the corresponding ambient space factors are the same.
Another relevant observation is that a polynomial linear in the coordinates of a single P n defines a sub-manifold P n−1 ⊂ P n . This means that a multi-degree q α with a single non-zero entry q r α = 1 can be removed from a configuration matrix while simultaneously reducing the dimension n r to n r − 1. To exclude such cases, we will require the degree of a JHEP07(2013)070 polynomial to be at least two if it depends on one projective space only. This is equivalent to the condition m r=1 q r α ≥ 2 , ∀α = 1, . . . , K , which we impose on all configuration matrices. Further, we note that we are not interested in block-diagonal configuration matrices of the form The sub-configuration [1|2] describes two points in P 1 and the above configuration is, therefore, equivalent to two copies of [n|q]. Now focus on configuration matrices with a fixed size, (m, K). All such matrices can be generated by a two-step procedure that is well-suited for machine computation [14]. First, one lists all m-dimensional integer vectors n with n r > 0, ordered such that n r ≥ n s if r > s, which satisfy the dimensional constraint m r=1 n r = K + 4. Second, for each n, one lists all matrices q which satisfy eqs. (2.3), (2.4), excluding matrices of the form (2.5). This is most easily done by starting from an initial configuration and shifting row-wise according to while preserving the lexicographic order of rows and columns. For a given dimension vector n, this procedure clearly terminates. However, it is not clear that the complete algorithm will also terminate and lead to a finite list, since the list of vectors n is, a priori, unbounded. However, it has been observed [12] that beyond a certain upper limit in n, every configuration matrix is equivalent, by the above relations, to a smaller matrix and, hence, does not need to be included. In this sense, only the minimal configuration of a given manifold is kept in the list. More precisely, generalizing the arguments in ref. [12], it can be shown that minimal CICY d-folds satisfy the bounds Here, s is the number of ambient P 1 factors and p the number of ambient P n factors, with n > 1. The quantity α is defined as α := {r | nr>1} (n r − 1), where the sum is over all ambient P n factors with n > 1. Since this bounds the total number, m, of ambient projective spaces as well as the total ambient space dimension from above, the set of minimal configurations is finite. For CICY four-folds, we must set d = 4 and hence the bounds become There are 660 different possible ambient spaces that satisfy these bounds and they are presented in table 1.
As will be explained in section 4, it is possible to employ further techniques, beyond those discussed here to remove redundant descriptions of CICYs. This will lead to the refined, more efficient algorithm described in section 5. However, as we will see, the simple method outlined in this section still serves a useful purpose as the first, initiating step of the full algorithm. Table 1. All possible ambient spaces for CICY four-folds are shown in this table. These 660 ambient manifolds fall into classes according to the number of P 1 -and P 2 -factors. The third column gives the excess number N ex = m r=1 (n r + 1) − 2K. It vanishes when all the columns sum to two which, from (2.4), is the minimal non-trivial value. A large value of N ex generally means that there are many ways to construct inequivalent configuration matrices for a given ambient space. The minimum number of P 1 factors is zero except for (

Chern classes and Euler characteristic
To implement more advanced methods for redundancy removal, we require explicit expressions for some of the topological properties of complete intersection manifolds. For this reason, we review the explicit formulae for the Euler characteristic, which is of particular importance, and the Chern classes. These formulae will be presented for general complete JHEP07(2013)070 intersection manifolds with configuration matrix [n|q] which do not necessarily have to satisfy the Calabi-Yau condition (2.3).
We begin with the total Chern class which is given by the expression [12] c where J r denotes the Kähler form of the r-th ambient projective space P nr , normalized in the standard way such that P nr Expanding (3.1) yields explicit formulae for the first four Chern classes. They are given by Here, the multi-index Kronecker delta is defined to be δ r An integration of a top-form ω over [n|q] is evaluated by pulling it back to an integration over the ambient space A = P n 1 1 × · · · × P nm m using

Equivalent configurations and redundancy removal
After this preparation, we can now discuss more refined equivalence relations between configuration matrices. It will then be a simple matter, in the next section, to construct an improvement on the "naive algorithm" given in section 2. There are several different ways in which two configuration matrices can be equivalent: I. Permutations of rows and columns. As we have already discussed, two configuration matrices are equivalent if they differ only by a permutation of rows or columns. The resulting redundancy is partially resolved by imposing the aforementioned lexicographic order on the rows and columns [1]. However, a residual redundancy remains. A "brute force" procedure to remove this redundancy is to generate all row and column permutations of a matrix and compare with the candidate equivalent configuration. For the larger CICY configuration matrices which appear in our classification, this eventually gets out of hand, due to the exponential growth of the number of permutations with matrix size.
An alternative method which is more efficient, particularly for large matrix size, works as follows. Consider two configurations, [n|q] and [n|q], of the same size. First we impose a sequence of necessary conditions for equivalence in order to identify inequivalent configurations efficiently. The algorithm is stopped as soon as non-equivalence is established. The first necessary condition is that the tallies of numbers in each row and column should coincide for two matrices related by row or column permutations. Hence, if the tally disagrees the matrices are inequivalent. In the second step, we compare the trace and eigenvalues of the m × m square matrices M = qq T andM =qq T . If either disagrees the matrices are inequivalent.
For configurations which pass these tests we have to find a necessary and sufficient criterion for equivalence. To this end consider O(m) matrices R andR diagonalizing M andM, that is, R T MR =R TMR = diag(a 1 , . . . , a m ). In addition, we assume that the eigenvalue spectrum {a r } is non-degenerate. 1 The crucial observation is then that, given a fixed order of the eigenvalues, the matrices R andR are essentially unique apart from a sign choice for each eigenvector. This sign ambiguity can be fixed by demanding that Given these sign conventions we then compute the matrix P =RR T and check if it is a permutation matrix. If it is not, the configurations are inequivalent. If it is, we compute JHEP07(2013)070 q = P Tq and check if it has the same column vector set as q. If it does, the two configurations are equivalent, otherwise they are not. All of the above can be efficiently implemented in Mathematica. The full proof that this procedure is indeed necessary and sufficient for deciding the equivalence of two configurations will be given in the forthcoming longer publication [10].
II. Ineffective splittings. The splitting principle [1] provides an efficient method of generating new configurations from old ones. It plays a key role in the algorithm to generate the full list of CICY configurations, as will be explained in section 5. As we shall see in what follows, deciding whether or not a four-fold splitting is effective, that is, whether it leads to a new manifold, cannot be accomplished by a simple generalization of the three-fold criterion and requires some new ideas.
A general P n splitting is defined as a relation of the form n n+1 a=1 u a q ←→ n 1 1 · · · 1 0 n u 1 u 2 · · · u n+1 q .

(4.2)
Read from left to right this correspondence is termed splitting while its inverse is called contraction. When the two configurations describe the same underlying manifold, the splitting is called ineffective, otherwise it is referred to as an effective splitting.
To decide whether or not the two configurations in (4.2) describe the same underlying manifold, we first note that these two manifolds share common loci in their complex structure moduli space, the so called determinantal variety. To see this, introduce homogeneous coordinates x = (x i ) i=0,...,n for the additional P n which arises in the splitting and a matrix F = (f ai ) of polynomials f ai with multi-degrees u a . Then, the zero locus of the first n + 1 polynomials in the split configuration in (4.2) can be written as Fx = 0. Evidently, this equation has a solution in P n if and only if p ≡ det(F) = 0. The polynomial p has multi-degree u = n+1 a=1 u a and is a specific instance of the first defining polynomial of the contracted configuration in (4.2). Together with the polynomials specified by q it defines the determinantal variety. The question then becomes whether or not this determinantal variety is smooth. If it is, the two configurations can be smoothly deformed into each other and, hence, represent the same topological type of Calabi-Yau manifolds. In this case, the splitting is ineffective. Otherwise, that is, when the determinantal variety has a non-trivial singular locus, they describe different manifolds and the splitting is effective.
For CICY three-fold splittings, the singular locus of the determinantal variety is a zero-dimensional space. That is, it can either be the empty set or a collection of points. It turns out that the number of singular points is counted, up to a non-zero numerical factor, by the difference of Euler characteristics between the original and the split configuration. This leads to the simple rule that two three-fold configurations, related by splitting as in (4.2), are equivalent if and only if they have the same Euler characteristic [1].
For a CICY four-fold, the singular locus of the determinantal variety has a more complicated structure. As was first noted in ref. [16], four-fold splittings have a different local degeneration structure than three-fold splittings. The determinantal variety of a CICY four-fold splitting becomes singular on a complex curve. The Euler characteristic of this

JHEP07(2013)070
curve is still proportional, with a non-zero factor, to the difference of Euler characteristics between the two configurations involved. This means that a four-fold splitting which changes the Euler characteristic is definitely effective. If the splitting preserves the Euler characteristic, however, then we only know that the singular locus must have vanishing Euler characteristic. This means that the singular locus could either be the empty set or a collection of tori. In the case of CICY four-folds, therefore, it is possible to have effective splittings at constant Euler characteristic. Clearly, to detect such effective splittings which preserve the Euler characteristic we need additional criteria.
For P 1 splittings between CICY four-folds, a necessary and sufficient criterion can be obtained as follows. In this case, the one-dimensional singular locus of the determinantal variety can be described as a complete intersection, associated to the configuration matrix S ≡ n u 1 u 1 u 2 u 2 q . We denote by µ S the form Poincaré-dual to this singular locus in the ambient space A, defined analogously to (3.8), and by J a Kähler form on A. A convenient choice for this Kähler form is J = m r=1 J r . Then, the volume of the singular locus can be calculated by where the subscript "top" refers to the coefficient of the top form J n 1 1 ∧ · · · ∧ J nm m of A, as before. With the expressions for J and µ S readily available, this allows for an explicit calculation of the volume, using the normalizations (3.2). Clearly, the singular set S is empty and, hence, the splitting ineffective, if and only if this volume vanishes. There is a trivial but helpful re-formulation of this criterion in terms of the associated zero-dimensional configuration S ≡ n u 1 u 1 u 2 u 2 q 1 , where 1 denotes a column with all entries 1. Then, for the choice of Kähler form J = m r=1 J r it follows that Hence, the splitting is effective if and only if χ(S ) = 0. Unfortunately, for higher P n splittings, n > 1, the singular locus cannot be described as a complete intersection. Hence, the above method cannot be applied and we have to rely on a different approach. As before, the first step is to compute the change of the Euler characteristic using (3.9). If the Euler characteristic changes, we have an effective splitting. Otherwise, we consider the following splittings between non-Calabi-Yau three-folds n n+1 a=1 u a q e i ←→ n 1 1 · · · 1 0 0 n u 1 u 2 · · · u n+1 q e i .

(4.5)
They are related to the original four-fold splitting (4.2) by adding one additional column, given by a standard m-dimensional unit vector e i , to both configuration matrices. The singular locus of these three-fold splittings consists of points whose number is proportional to the change in Euler characteristic. With the equations provided in section 3, we find

JHEP07(2013)070
that the change of Euler characteristic for each e i is given by whereû a := m r=1 u r a J r . Of course, the singular points associated to the three-fold splittings (4.5) are precisely the intersections of the four-fold singular locus (a complex curve) with the hyperplanes defined by the additional e i column. Hence, if the Euler characteristic changes for at least one e i the four-fold singular locus must be non-empty and the splitting is effective. Conversely, if the difference of Euler characteristics vanishes for all e i , that is, none of the hyperplanes intersects the four-fold singular locus, then this locus must be empty and the splitting is ineffective.
In general, if two configurations are found to be related by an ineffective splitting, they describe the same underlying manifold and only the contracted matrix (that is, the matrix on the left hand side of (4.2)) will be kept in our list.
III. Identities. Numerous identities between sub-configurations of CICYs have been uncovered and discussed in ref. [1]. For a few of them, only heuristic arguments exist. In the compilation of our list, we have only used those identities that have been proved rigorously and that commute with splitting, namely:

JHEP07(2013)070
The first column provides the labeling of the identities used in ref. [1]. The second and third columns state the basic identity and its application to the full configuration matrix, respectively. The identities are used from left to right, that is, whenever a matrix matches the pattern on the left hand side, it is replaced by the matrix on the right hand side. The proof of the basic identities in the second column is facilitated by the fact that these are either identities between one-folds or between two-folds of positive first Chern class. Both sets of manifolds are classified by their Euler characteristics, which can be computed straightforwardly by using the formulae of section 3. This concludes the list of equivalence relations we will be using in our classification algorithm. Their application greatly reduces the number of repetitions in our final list of CICY four-folds. However, they do not represent an exhaustive list of identities. It is to be expected that our list of CICY four-folds still contains some repetitions. This is indeed the case for the list of 7890 CICY three-folds and has been explicitly checked in ref. [15], using Wall's theorem [14]. For our CICY four-fold list the obvious course of action is to compute topological quantities in order to discriminate between inequivalent configurations and to determine a lower bound for the number of inequivalent four-fold CICYs. Useful topological quantities in question include the Euler characteristic, Chern classes, Hodge numbers and intersection numbers. In the present paper, we will only explicitly use the Euler characteristic for this purpose. A more complete discussion which includes the other quantities will be presented in the companion paper [10]. However, the experience with CICY three-folds suggests that the number of inequivalent configurations is of the same order of magnitude as the total number of configurations in the list.

The algorithm
In section 2, we have described a simple and finite algorithm to directly generate all possible configuration matrices. It turns out that this naive algorithm is prohibitively slow and requires a computation time which is unfeasibly long. In this section, we use an adapted version of an algorithm first devised by Candelas et al. [1] for CICY three-folds. The basic idea is to employ the splitting principle in order to generate new CICY configuration matrices starting from a relatively small initial set.
In the first step of the algorithm, we compile a list of all configuration matrices in ambient spaces that do not contain any P 1 factors. This is done using the naive algorithm of section 2. There are 62 such ambient spaces out of the 660 listed in table 1. A new matrix is only added to the list if it is not related by row or column permutations to a matrix already contained in the list. After about 987 CPU hours, 2 a list L 0 consisting of 9522 configuration matrices in ambient spaces without P 1 factors is produced. This list is then subjected to a routine we will refer to as the second filter. This filter takes a list of matrices and removes the three different types of redundancies described in sections 4.I-III as well as matrices of the form (2.5). The second filter routine thus produces a minimal version ("minimal" JHEP07(2013)070 start "naive algorithm" 2ndfilter(L0) splitting(L 0 ) . . . Figure 1. Logic flowchart of the algorithm described in section 5. The boxes label the routines executed at each step and the arguments in parentheses are the input for the routines. The "naive algorithm" is presented in section 2. The second filter routine is denoted "2ndfilter" for brevity. By "splitting", we refer to a routine which carries out all possible P 1 splittings on the matrices of the input list. The output lists are displayed above the arrows. The sets ∆ i are defined as ∆ i := L i \ L i−1 . The algorithm terminates after 11 consecutive splittings with the routine 2ndfilter(L 10 ∪ L 11 ), which produces the final output L 11 .
in the sense of both the number of matrices and the size of each individual matrix) of the input list. When applied to L 0 , it yields a reduced list L 0 containing 4898 matrices.
Since the identities listed in section 4.III have been applied, the list L 0 does contain some matrices with P 1 factors in their ambient spaces. In particular some matrices with rows of the form 1 2 0 · · · 0 are present. The only type of matrices missing from this list are those that contain one or more rows of the form 1 1 1 0 · · · 0 . According to the splitting relation (4.2), these matrices must be related to the matrices in L 0 by contraction. Conversely, the full list can be produced by repeatedly performing P 1 splittings in all possible ways on the matrices in L 0 .
The first complete P 1 splitting of L 0 yields a list L 1 consisting of 28823 matrices. The union of L 0 and L 1 is then subjected to the second filter routine. The output is a list L 1 . It contains L 0 plus 25222 new matrices making a total of 30120. Afterwards, the set difference ∆ 1 = L 1 \ L 0 is split in all possible ways to obtain a list L 2 and the union L 1 ∪ L 2 is subjected to the second filter routine to yield a list L 2 . This is repeated until no more new matrices are produced. The inequality (2.8) guarantees that the algorithm terminates after L 12 at the latest. In the actual execution of the algorithm, it turns out that already after L 11 , all splittings become ineffective. Hence, L 11 represents the final result.
A logic flowchart depicting the steps of the algorithm is shown in figure 1.

Results
Before we describe the results of our CICY four-fold classification, we first check that our implementation of the algorithm described in section 5 successfully reproduces the known list of CICY three-folds. The original CICY three-fold list compiled in ref. [1] can be obtained from [17,18]. It consists of 7890 CICY three-fold configuration matrices which include 22 direct product manifolds and 7868 spaces that cannot be written as direct products. A comparison with the list produced by our code shows a perfect match. The total CPU time to compile this list was just 72 minutes.

JHEP07(2013)070
We now present our main result, a complete classification of CICY four-folds. The list contains 921,497 configuration matrices ranging up to a matrix size of 16 × 20. The total required CPU time was 7487 hours, that is about 312 days on a single CPU. 3 A subset of 15813 matrices corresponds to product manifolds. These fall into four types as listed in the following table:

Type
Number of matrices Euler characteristic χ T 8 5 0 The Euler characteristic of these direct product manifolds follows from χ(M × N ) = χ(M ) · χ(N ) together with χ(T n ) = 0 and χ(K3) = 24. The numbers of these different types of direct product matrices in the second column can be explained as follows. The algorithm produces two different configuration matrices for T 2 , namely The Euler characteristic for each of the 921,497 matrices was computed and found to be in the range 0 ≤ χ ≤ 2610. As mentioned above, all configurations with Euler characteristic 0 correspond to direct product manifolds and the non-zero values for the Euler characteristic are found to be in the range 288 ≤ χ ≤ 2610. A logarithmic plot of the distribution of Euler characteristics is shown in figure 2. About 25% of all matrices have Euler characteristic equal to 288, the smallest non-zero value in the list. This huge peak at a single value might indicate non-trivial residual redundancies in the list. The full list of configuration matrices with Euler characteristics can be downloaded from [19].
In total, the list contains 206 different values of χ and, hence, this provides a weak lower bound on the number of inequivalent CICY four-folds. As already mentioned, this bound can be significantly strengthened by computing additional topological data, such JHEP07(2013)070 as Hodge numbers, Chern classes and intersection numbers. A detailed analysis will be presented in ref. [10], but a preliminary calculation shows that the data set contains at least 3737 different sets of Hodge numbers. Computing even finer topological invariants will strengthen this bound further.
Finally, we should address the question of how many CICY four-folds in our list have an elliptic fibration structure. We will not attempt to answer this question in full generality since a necessary and sufficient criterion for the existence of such an elliptic fibration which is suitable for practical computations is currently not known. Fortunately, for CICYs there is a particularly simple type of elliptic fibration which is consistent with the embedding in the projective ambient space. Suppose a configuration matrix [n|q] for a CICY four-fold can be brought, by a combination of row and column permutations, into the equivalent form n F F 0 n B C B , (6.2) such that the sub-configuration [n F |F ] is a one-fold. Then, the CICY four-fold is elliptically fibered with [n F |F ] representing the T 2 fiber and [n B |B] the three-fold base while the entries C describe the structure of the fibration, that is, the way in which the fiber is twisted over the base. We have checked how many CICY configuration matrices from our list can be brought into the form (6.2). It turns out that this is possible for all but 477 of the 921,497 matrices. Moreover, in many cases a given configuration matrix can be brought into the form (6.2) in many different, inequivalent ways, indicating the existence of inequivalent fibrations. Unfortunately, an elliptic fibration structure of this kind does not automatically imply the existence of a section. However, a preliminary analysis shows that the vast majority of JHEP07(2013)070 manifolds indeed admit fibrations which do have sections. Details of this analysis will be presented in ref. [10].

Summary and outlook
In this paper, we have classified all complete intersection Calabi-Yau four-folds (CICYs) in ambient spaces which consist of products of projective spaces. We have found a list of 921,497 configuration matrices which represent all topologically distinct CICYs. This is to be compared with 7890 configuration matrices which were found in the analogous classification for CICY three-folds carried out in ref. [1]. A total of 15813 configuration matrices from our four-fold list describe direct product manifolds of various types but all other matrices represent non-decomposable CICY four-folds. Discarding the cases with Euler characteristic 0 which all correspond to direct product manifolds, the Euler characteristic is in the range 288 ≤ χ ≤ 2610. The list contains 206 different values for the Euler characteristic, a weak lower bound for the number of inequivalent CICY four-folds. This bound can be strengthened by considering additional topological invariants. For example, a preliminary analysis shows that the list contains at least 3737 different sets of Hodge numbers. We have also studied the existence of a particular class of elliptic fibrations, consistent with the projective embedding of the manifolds, and have found that almost all manifolds in our list are elliptically fibered in this way. Often, a given CICY four-fold allows for many fibrations of this kind. A preliminary analysis shows that most of these manifolds admit such fibrations which have sections.
We hope that the data set compiled in this paper will be of use in various branches of mathematics and physics. Due to their embedding in projective ambient spaces, CICYs are particularly simple and many of their properties are accessible through direct calculation. In the context of string theory, Calabi-Yau four-folds can be used for string compactifications, for example of type II or heterotic theories to two dimensions or, perhaps most importantly, of F-theory to four dimensions. F-theory compactifications require elliptically fibered Calabi-Yau four-folds, preferably with a section, and we have seen that our manifolds support these properties.
We have left a number of more advanced issues for a longer companion paper [10] which is currently in preparation. These include the calculation of Hodge numbers, Chern classes and intersection numbers as well as a more detailed analysis of elliptic fibrations. This additional data will allow us to place a more realistic lower bound on the number of inequivalent CICY four-folds. It will also facilitate applications, particularly in the context of F-theory.