PALP：用于分析格点多面体并应用于环面几何的软件包
PALP: A Package for Analyzing Lattice Polytopes with Applications to Toric Geometry
AI总结：
PALP是一个用于格点多面体计算及环面几何应用的C程序包，提供顶点/面枚举、自反多面体分类等功能，适用于任意维度且性能优异。
摘要：
我们描述了我们的C程序软件包PALP，它用于格点多面体的计算以及环面几何的应用，该软件包可在互联网上免费获取。它包含用于顶点和面枚举、关联和对称性计算，以及给定点集的凸包中格点集合完备化的例程。此外，还有专门针对自反多面体的程序，例如自反子多面体的枚举，以及环面几何和弦理论的应用，如环面Calabi-Yau流形的Hodge数据和纤维化结构的计算。该软件包经过充分测试并在速度上进行了优化，因为它被用于耗时的任务，例如4维自反多面体的分类以及5维多面体超大型列表的创建和操作。虽然最初设计用于低维应用，但算法适用于任何维度，并且我们用于顶点和面枚举的关键例程与现有软件包相比表现良好。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
