arXiv Analytics

Sign in

arXiv:2306.12080 [math.CO]AbstractReferencesReviewsResources

Algebraic Volume for Polytope Arise from Ehrhart Theory

Guoce Xin, Xinyu Xu, Yingrui Zhang, Zihao Zhang

Published 2023-06-21Version 1

Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of the polytope. We consider the cone $ \mathrm{cone}(\mathcal{P})$ over $\mathcal{P}$ in view of Ehrhart theory. By using technique from algebraic combinatorics, we obtain an algorithm using only signed simplicial cone decompositions of $ \mathrm{cone}(\mathcal{P})$. 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.

Related articles: Most relevant | Search more
arXiv:1405.7647 [math.CO] (Published 2014-05-29, updated 2014-07-22)
An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics
arXiv:1505.07377 [math.CO] (Published 2015-05-27)
Unimodality Problems in Ehrhart Theory
arXiv:2210.10734 [math.CO] (Published 2022-10-19)
Beyond positivity in Ehrhart Theory