PALP: A Package for Analysing Lattice Polytopes with applications to toric geometry

Abstract
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 specialized to reflexive polytopes such as the enumeration of reflexive subpolytopes, and applications to to...

Title of program: PALP
Catalogue Id: ADSQ_v1_0

Nature of problem
Certain lattice polytopes called reflective polytopes afford a combinatorial description of a very large class of Calabi-Yau manifolds in terms of toric geometry. These manifolds play an essential role for compactifications of string theory. While originally designed to handle and classify reflexive polytopes, with particular emphasis on problems relevant to string theory applications, the package also handles standard questions (facet enumeration and similar problems) about arbitrary lattice po ...

Versions of this program held in the CPC repository in Mendeley Data
ADSQ_v1_0; PALP; 10.1016/S0010-4655(03)00491-0

This program has been imported from the CPC Program Library held at Queen's University Belfast (1969-2018)