Saved in:
Bibliographic Details
Main Authors: Kreuzer, Maximilian, Skarke, Harald
Format: Preprint
Published: 2002
Subjects:
Online Access:https://arxiv.org/abs/math/0204356
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918162849595392
author Kreuzer, Maximilian
Skarke, Harald
author_facet Kreuzer, Maximilian
Skarke, Harald
contents We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of incidences and symmetries, as well as completion of the set of lattice points in the convex hull of a given set of points. In addition, there are procedures specialised to reflexive polytopes such as the enumeration of reflexive subpolytopes, and applications to toric geometry and string theory, like the computation of Hodge data and fibration structures for toric Calabi-Yau varieties. The package is well tested and optimised in speed as it was used for time consuming tasks such as the classification of reflexive polyhedra in 4 dimensions and the creation and manipulation of very large lists of 5-dimensional polyhedra. While originally intended for low-dimensional applications, the algorithms work in any dimension and our key routine for vertex and facet enumeration compares well with existing packages.
format Preprint
id arxiv_https___arxiv_org_abs_math_0204356
institution arXiv
publishDate 2002
record_format arxiv
spellingShingle PALP: A Package for Analyzing Lattice Polytopes with Applications to Toric Geometry
Kreuzer, Maximilian
Skarke, Harald
Numerical Analysis
High Energy Physics - Theory
Algebraic Geometry
52-04 (Primary), 52B20, 14J32, 14M25, 81T30 (Secondary)
We describe our package PALP of C programs for calculations with lattice polytopes and applications to toric geometry, which is freely available on the internet. It contains routines for vertex and facet enumeration, computation of incidences and symmetries, as well as completion of the set of lattice points in the convex hull of a given set of points. In addition, there are procedures specialised to reflexive polytopes such as the enumeration of reflexive subpolytopes, and applications to toric geometry and string theory, like the computation of Hodge data and fibration structures for toric Calabi-Yau varieties. The package is well tested and optimised in speed as it was used for time consuming tasks such as the classification of reflexive polyhedra in 4 dimensions and the creation and manipulation of very large lists of 5-dimensional polyhedra. While originally intended for low-dimensional applications, the algorithms work in any dimension and our key routine for vertex and facet enumeration compares well with existing packages.
title PALP: A Package for Analyzing Lattice Polytopes with Applications to Toric Geometry
topic Numerical Analysis
High Energy Physics - Theory
Algebraic Geometry
52-04 (Primary), 52B20, 14J32, 14M25, 81T30 (Secondary)
url https://arxiv.org/abs/math/0204356