Datasets:

Modalities:
Tabular
Formats:
parquet
ArXiv:
Libraries:
Datasets
Dask
License:
Search is not available for this dataset
weight0
int32
1
2.24k
weight1
int32
1
3.36k
weight2
int32
1
97.8k
weight3
int32
1
601k
weight4
int32
1
1.4M
weight5
int32
2
2.1M
vertex_count
int32
6
47
facet_count
int32
6
59
point_count
int32
7
189k
1
1
6
8
15
27
26
16
1,893
1
1
8
41
53
104
14
11
11,869
1
1
12
21
35
58
19
14
3,760
1
2
3
9
28
43
15
10
3,968
1
2
4
17
25
49
24
15
3,001
1
2
5
8
11
15
24
16
570
1
2
5
33
45
84
17
12
6,283
1
2
6
12
29
49
18
12
2,560
1
2
6
22
31
39
28
21
1,855
1
2
7
8
8
18
15
10
591
1
2
7
15
25
48
23
19
1,995
1
2
7
23
49
79
20
19
4,784
1
2
7
45
59
66
24
21
4,329
1
2
8
13
33
43
25
20
1,898
1
2
9
20
29
39
20
16
1,396
1
2
9
28
70
110
17
14
7,285
1
2
9
51
73
134
19
15
8,809
1
2
10
24
27
63
30
25
2,247
1
2
11
18
24
56
16
13
1,847
1
2
11
27
29
65
24
18
2,236
1
2
11
40
92
145
26
25
9,748
1
2
12
13
17
41
13
11
1,216
1
2
12
19
58
92
16
13
4,768
1
2
13
22
29
45
28
21
1,341
1
2
13
32
35
78
28
22
2,655
1
2
14
17
24
30
24
20
888
1
2
14
24
31
71
27
19
2,247
1
2
15
39
109
161
25
20
9,983
1
2
15
69
89
106
20
20
5,139
1
2
16
21
41
79
20
15
2,674
1
2
16
33
55
58
18
13
2,057
1
2
16
103
241
362
20
18
38,014
1
2
17
25
26
29
25
23
896
1
2
17
38
58
88
22
18
3,013
1
2
19
25
45
46
17
16
1,449
1
2
19
60
159
239
16
14
16,090
1
2
21
29
33
34
23
17
1,047
1
2
21
46
67
116
25
20
3,863
1
2
21
72
188
284
16
13
20,017
1
2
23
27
56
84
24
19
2,575
1
2
23
38
64
67
28
26
2,135
1
2
26
42
115
160
17
15
6,849
1
2
27
32
91
121
19
19
4,520
1
2
27
90
122
214
22
22
8,641
1
2
28
35
69
72
23
14
2,210
1
2
29
41
103
134
28
26
4,873
1
2
29
73
151
256
19
18
11,829
1
2
31
43
54
130
28
21
3,601
1
2
35
47
97
147
21
17
4,594
1
2
35
110
185
332
24
21
15,156
1
2
36
47
87
126
26
17
3,626
1
2
37
50
93
96
28
21
2,899
1
2
37
121
161
200
21
20
7,575
1
2
39
68
148
190
17
15
6,771
1
2
41
57
85
186
19
16
5,355
1
2
41
213
299
556
19
13
32,230
1
2
43
269
359
674
22
16
43,730
1
2
45
76
248
372
15
14
19,764
1
2
47
55
114
219
21
15
6,905
1
2
53
275
661
991
24
23
87,637
1
2
55
66
179
302
24
22
11,380
1
2
71
226
528
827
23
22
48,525
1
2
79
95
259
436
17
13
16,381
1
2
92
127
443
665
17
18
33,072
1
3
5
18
24
31
24
18
1,048
1
3
5
31
48
88
24
18
4,740
1
3
6
19
39
68
16
10
2,832
1
3
6
39
59
69
18
13
3,450
1
3
7
11
22
26
24
16
725
1
3
7
17
22
33
26
17
864
1
3
7
23
29
31
22
21
964
1
3
7
33
43
81
19
21
3,077
1
3
8
13
26
30
19
19
816
1
3
8
27
33
42
22
17
1,222
1
3
8
40
52
97
26
21
3,757
1
3
9
11
12
33
16
9
761
1
3
9
17
19
49
19
12
1,179
1
3
10
26
29
69
19
13
1,782
1
3
10
33
81
125
18
16
5,680
1
3
10
47
62
113
23
18
4,111
1
3
11
24
39
53
28
20
1,333
1
3
11
30
34
73
24
23
1,843
1
3
11
41
55
59
29
26
1,830
1
3
11
64
153
227
25
27
15,189
1
3
13
21
24
38
22
16
766
1
3
13
28
81
123
18
15
4,834
1
3
13
33
63
76
24
21
2,199
1
3
13
44
55
71
29
28
1,932
1
3
13
61
78
91
19
15
3,071
1
3
14
20
44
82
25
18
2,169
1
3
14
45
80
142
24
18
4,834
1
3
14
64
79
159
23
22
5,490
1
3
15
17
63
96
16
14
3,364
1
3
15
22
77
116
21
19
4,356
1
3
15
38
95
149
24
19
5,608
1
3
15
54
116
189
10
8
7,994
1
3
16
21
38
78
27
26
1,775
1
3
16
26
30
31
24
25
694
1
3
16
35
55
77
27
25
1,812
1
3
16
41
44
62
28
27
1,375

Weight Systems Defining Five-Dimensional IP Lattice Polytopes

This dataset contains all weight systems defining five-dimensional reflexive and non-reflexive IP lattice polytopes, instrumental in the study of Calabi-Yau fourfolds in mathematics and theoretical physics. The data was compiled by Harald Skarke and Friedrich SchΓΆller in arXiv:1808.02422. More information is available at the Calabi-Yau data website. The dataset can be explored using the search frontend. See below for a short mathematical exposition on the construction of polytopes.

Please cite the paper when referencing this dataset:

@article{Scholler:2018apc,
    author = {SchΓΆller, Friedrich and Skarke, Harald},
    title = "{All Weight Systems for Calabi-Yau Fourfolds from Reflexive Polyhedra}",
    eprint = "1808.02422",
    archivePrefix = "arXiv",
    primaryClass = "hep-th",
    doi = "10.1007/s00220-019-03331-9",
    journal = "Commun. Math. Phys.",
    volume = "372",
    number = "2",
    pages = "657--678",
    year = "2019"
}

Dataset Details

The dataset consists of two subsets: weight systems defining reflexive (and therefore IP) polytopes and weight systems defining non-reflexive IP polytopes. Each subset is split into 4000 files in Parquet format. Rows within each file are sorted lexicographically by weights. There are 185,269,499,015 weight systems defining reflexive polytopes and 137,114,261,915 defining non-reflexive polytopes, making a total of 322,383,760,930 IP weight systems.

Each row in the dataset represents a polytope and contains the six weights defining it, along with the vertex count, facet count, and lattice point count. The reflexive dataset also includes the Hodge numbers h1,1 h^{1,1} , h1,2 h^{1,2} , and h1,3 h^{1,3} of the corresponding Calabi-Yau manifold, and the lattice point count of the dual polytope.

For any Calabi-Yau fourfold, the Euler characteristic Ο‡ \chi and the Hodge number h2,2 h^{2,2} can be derived as follows:

Ο‡=48+6(h1,1βˆ’h1,2+h1,3) \chi = 48 + 6 (h^{1,1} βˆ’ h^{1,2} + h^{1,3})

h2,2=44+4h1,1βˆ’2h1,2+4h1,3 h^{2,2} = 44 + 4 h^{1,1} βˆ’ 2 h^{1,2} + 4 h^{1,3}

This dataset is licensed under the CC BY-SA 4.0 license.

Data Fields

  • weight0 to weight5: Weights of the weight system defining the polytope.
  • vertex_count: Vertex count of the polytope.
  • facet_count: Facet count of the polytope.
  • point_count: Lattice point count of the polytope.
  • dual_point_count: Lattice point count of the dual polytope (only for reflexive polytopes).
  • h11: Hodge number h1,1 h^{1,1} (only for reflexive polytopes).
  • h12: Hodge number h1,2 h^{1,2} (only for reflexive polytopes).
  • h13: Hodge number h1,3 h^{1,3} (only for reflexive polytopes).

Usage

The dataset can be used without downloading it entirely, thanks to the streaming capability of the datasets library. The following Python code snippet demonstrates how to stream the dataset and print the first five rows:

from datasets import load_dataset

dataset = load_dataset("calabi-yau-data/ws-5d", name="reflexive", split="full", streaming=True)

for row in dataset.take(5):
    print(row)

When cloning the Git repository with Git Large File Storage (LFS), data files are stored both in the Git LFS storage directory and in the working tree. To avoid occupying double the disk space, use a filesystem that supports copy-on-write, and run the following commands to clone the repository:

# Initialize Git LFS
git lfs install

# Clone the repository without downloading LFS files immediately
GIT_LFS_SKIP_SMUDGE=1 git clone https://huggingface.co/datasets/calabi-yau-data/ws-5d

# Change to the repository directory
cd ws-5d

# Test deduplication (optional)
git lfs dedup --test

# Download the LFS files
git lfs fetch

# Create working tree files as clones of the files in the Git LFS storage directory using
# copy-on-write functionality
git lfs dedup

Construction of Polytopes

This is an introduction to the mathematics involved in the construction of polytopes relevant to this dataset. For more details and precise definitions, consult the paper arXiv:1808.02422 and references therein.

Polytopes

A polytope is the convex hull of a finite set of points in nn-dimensional Euclidean space, Rn\mathbb{R}^n. This means it is the smallest convex shape that contains all these points. The minimal collection of points that define a particular polytope are its vertices. Familiar examples of polytopes include triangles and rectangles in two dimensions, and cubes and octahedra in three dimensions.

A polytope is considered an IP polytope (interior point polytope) if the origin of Rn\mathbb{R}^n is in the interior of the polytope, not on its boundary or outside it.

For any IP polytope βˆ‡\nabla, its dual polytope βˆ‡βˆ—\nabla^* is defined as the set of points y\mathbf{y} satisfying

xβ‹…yβ‰₯βˆ’1for all xβˆˆβˆ‡β€…β€Š. \mathbf{x} \cdot \mathbf{y} \ge -1 \quad \text{for all } \mathbf{x} \in \nabla \;.

This relationship is symmetric: the dual of the dual of an IP polytope is the polytope itself, i.e., βˆ‡βˆ—βˆ—=βˆ‡ \nabla^{**} = \nabla .

Weight Systems

Weight systems provide a means to describe simple polytopes known as simplices. A weight system is a tuple of real numbers. The construction process is outlined as follows:

Consider an nn-dimensional simplex in Rn\mathbb{R}^n, i.e., a polytope in Rn\mathbb{R}^n with vertex count n+1n + 1 and nn of its edges extending in linearly independent directions. It is possible to position nn of its vertices at arbitrary (linearly independent) locations through a linear transformation. The placement of the remaining vertex is then determined. Its position is the defining property of the simplex. To specify the position independently of the applied linear transformation, one can use the following equation. If v0,v1,…,vn\mathbf{v}_0, \mathbf{v}_1, \dots, \mathbf{v}_n are the vertices of the simplex, this relation fixes one vertex in terms of the other nn:

βˆ‘i=0nqivi=0β€…β€Š, \sum_{i=0}^n q_i \mathbf{v}_i = 0 \;,

where qiq_i is the tuple of real numbers, the weight system.

It is important to note that scaling all weights in a weight system by a common factor results in an equivalent weight system that defines the same simplex.

The condition that a simplex is an IP simplex is equivalent to the condition that all weights in its weight system are bigger than zero.

For this dataset, the focus is on a specific construction of lattice polytopes described in subsequent sections.

Lattice Polytopes

A lattice polytope is a polytope with vertices at the points of a regular grid, or lattice. Using linear transformations, any lattice polytope can be transformed so that its vertices have integer coordinates, hence they are also referred to as integral polytopes.

The dual of a lattice with points LL is the lattice consisting of all points y\mathbf{y} that satisfy

xβ‹…y∈Zfor all x∈Lβ€…β€Š. \mathbf{x} \cdot \mathbf{y} \in \mathbb{Z} \quad \text{for all } \mathbf{x} \in L \;.

Reflexive polytopes are a specific type of lattice polytope characterized by having a dual that is also a lattice polytope, with vertices situated on the dual lattice. These polytopes play a central role in the context of this dataset.

The weights of a lattice polytope are always rational. This characteristic enables the rescaling of a weight system so that its weights become integers without any common divisor. This rescaling has been performed in this dataset.

The construction of the lattice polytopes from this dataset works as follows: We start with the simplex βˆ‡\nabla, arising from a weight system as previously described. Then, we define the polytope Ξ”\Delta as the convex hull of the intersection of βˆ‡βˆ—\nabla^* with the points of the dual lattice. In the context of this dataset, the polytope Ξ”\Delta is referred to as β€˜the polytope’. Correspondingly, Ξ”β€‰β£βˆ—\Delta^{\!*} is referred to as β€˜the dual polytope’. The lattice of βˆ‡\nabla and Ξ”β€‰β£βˆ—\Delta^{\!*} is taken to be the coarsest lattice possible, such that βˆ‡\nabla is a lattice polytope, i.e., the lattice generated by the vertices of βˆ‡\nabla. This construction is exemplified in the following sections.

A weight system is considered an IP weight system if the corresponding Ξ”\Delta is an IP polytope; that is, the origin is within its interior. Since only IP polytopes have corresponding dual polytopes, this condition is essential for the polytope Ξ”\Delta to be classified as reflexive.

Two Dimensions

In two dimensions, all IP weight systems define reflexive polytopes and every vertex of βˆ‡βˆ—\nabla^* lies on the dual lattice, making Ξ”\Delta and βˆ‡βˆ—\nabla^* identical. There are exactly three IP weight systems that define two-dimensional polytopes (polygons). Each polytope is reflexive and has three vertices and three facets (edges):

weight system number of points of βˆ‡\nabla number of points of βˆ‡βˆ—\nabla^*
(1, 1, 1) 4 10
(1, 1, 2) 5 9
(1, 2, 3) 7 7

The polytopes and their duals are depicted below. Lattice points are indicated by dots.

General Dimension

In higher dimensions, the situation becomes more complex. Not all IP polytopes are reflexive, and generally, Ξ”β‰ βˆ‡βˆ—\Delta \neq \nabla^*.

This example shows the construction of the three-dimensional polytope Ξ”\Delta with weight system (2, 3, 4, 5) and its dual Ξ”β€‰β£βˆ—\Delta^{\!*}. Lattice points lying on the polytopes are indicated by dots. Ξ”\Delta has 7 vertices and 13 lattice points, Ξ”β€‰β£βˆ—\Delta^{\!*} also has 7 vertices, but 16 lattice points.

The counts of reflexive single-weight-system polytopes by dimension nn are:

nn reflexive single-weight-system polytopes
2 3
3 95
4 184,026
5 (this dataset) 185,269,499,015

One should note that distinct weight systems may well lead to the same polytope (we have not checked how often this occurs). In particular it seems that polytopes with a small number of lattice points are generated many times.

Downloads last month
960
Edit dataset card