Algebraic Volume for Polytope Arise from Ehrhart Theory

preprint2024arXivOpen access

Abstract

Volume computation for dd-polytopes P\mathcal{P} is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of P\mathcal{P}. We consider cone(P) \mathrm{cone}(\mathcal{P}) as a lift of P\mathcal{P} in view of Ehrhart theory. By using technique from algebraic combinatorics, we obtain a volume algorithm using only signed simplicial cone decompositions of cone() \mathrm{cone}(¶). Each cone is associated with a simple algebraic volume formula. Summing them gives the volume of the polytope. Our volume formula applies to various kind of cases. In particular, we use it to explain the traditional triangulation method and Lawrence's signed decomposition method. Moreover, we give a completely new primal-dual method for volume computation. This solves the traditional problem in this area: All existing methods are hopelessly impractical for either the class of simple polytopes or the class of simplicial polytopes. Our method has a good performance in computer experiments.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.