arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1301.6641math.CO
收藏

凸格多面体的Normal forms

Normal forms of convex lattice polytopes

Roland Grinis, Alexander Kasprzyk

摘要:

我们描述了一个算法,用于确定是否两个凸多胞体P和Q,嵌入在一个格,是同构的格自同构。我们将其扩展到确定P和Q是否等价的方法,即是否存在将P发送到Q的仿射格自同构。给出了P的自同构群和仿射自同构群的计算方法。另一种策略是确定一个范式,使得P和Q同构当且仅当它们的范式相等。这是Kreuzer和Skarke在他们的PALP软件中采用的方法。本文详细介绍了Kreuzer-Skarke方法,并给出了P具有多个对称时的改进算法。大量的例子,加上两个包含详细伪代码的附录,应该有助于这些技术的任何未来的重新实现。最后,我们解释如何定义和计算洛朗多项式的标准形。

英文摘要:

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether there exists an affine lattice automorphism that sends P to Q. Methods for calculating the automorphism group and affine automorphism group of P are also described. An alternative strategy is to determine a normal form such that P and Q are isomorphic if and only if their normal forms are equal. This is the approach adopted by Kreuzer and Skarke in their PALP software. We describe the Kreuzer-Skarke method in detail, and give an improved algorithm when P has many symmetries. Numerous examples, plus two appendices containing detailed pseudo-code, should help with any future reimplementations of these techniques. We conclude by explaining how to define and calculate the normal form of a Laurent polynomial.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑