Classification of reflexive polyhedra in three dimensions (Q1294798): Difference between revisions

Given a lattice \(M\), a lattice polytope is a polytope on the real extension \(M_{\mathbb R}\) of \(M\) whose vertices lie in \(M\). A lattice polytope \(\Delta\subset M_{\mathbb R}\) is called reflexive if its dual \(\Delta^* =\{ y\in N_{\mathbb R} : \langle y,x \rangle\geq -1\;\forall x\in M_{\mathbb R}\}\) is a lattice polytope with respect to the lattice \(N\) dual to \(M\). In the article under review, the authors present an algorithm for the classification of reflexive polytopes in arbitrary dimensions. They also present the results of an application of this algorithm to the case of three dimensional reflexive polytopes. The study is motivated by the Calabi-Yau compactifications in string theory since the duality of reflexive polytopes corresponds to the mirror symmetry of the resulting Calabi-Yau manifolds. Previously the above mentioned algorithm was used by the authors to reobtain the known 16 two-dimensional reflexive polytopes [Commun. Math. Phys. 185, No. 2, 495-508 (1997; Zbl 0894.14026)].