Volume computation for polytopes and partition functions for classical root systems (Q2498937): Difference between revisions

This paper develops an algorithm for computing the volume and number of integer points of a polytope. It is used to give a fast algorithm for the computation of the partition function of classical root systems. The approach is based on the inverse Laplace transform of rational functions on the complement of a hyperplane arrangement. Jeffrey-Kirwan residues [\textit{L. C. Jeffrey} and \textit{F. C. Kirwan}, Topology 34, 291--327 (1995; Zbl 0833.55009)] are computed using the maximal nested sets of \textit{C. DeConcini} and \textit{C. Procesi} [Progress in Mathematics 235, 139--149 (2005; Zbl 1093.52503)]. The authors discuss implementation for the various classical root systems, and compare their algorithm with the Sp (special permutations) algorithm of Baldoni, et al., and with LattE, the software package developed by DeLoera, et al.\ (based on Barvinok's algorithm).