Computing the volume, counting integral points, and exponential sums

DOI10.1007/BF02573970zbMath0774.68054MaRDI QIDQ685177

Alexander I. Barvinok

Publication date: 30 September 1993

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131266

zbMATH Keywords

convex polytopes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20) Exponential sums and character sums (11L99)

Related Items (21)

Polyhedral omega: a new algorithm for solving linear Diophantine systems ⋮ Algebraic Perspectives on Signomial Optimization ⋮ Higher integrality conditions, volumes and Ehrhart polynomials ⋮ Linear extension sums as valuations on cones ⋮ Equivariant localization and holography ⋮ Integer programming, Barvinok's counting algorithm and Gomory relaxations. ⋮ Eigenvalue distributions of reduced density matrices ⋮ A generalization of Löwner-John's ellipsoid theorem ⋮ Geometry of log-concave density estimation ⋮ NEW MODELS FOR VENEZIANO AMPLITUDES: COMBINATORIAL, SYMPLECTIC AND SUPERSYMMETRIC ASPECTS ⋮ Volume of slices and sections of the simplex in closed form ⋮ Residue formulae, vector partition functions and lattice points in rational polytopes ⋮ On the parameters of \(r\)-dimensional toric codes ⋮ Statistical properties of the single linkage hierarchical clustering estimator ⋮ Bayesian analysis of binary sequences ⋮ Polyhedral circuits and their applications ⋮ A generating function for all semi-magic squares and the volume of the Birkhoff polytope ⋮ Computing the Ehrhart quasi-polynomial of a rational simplex ⋮ On distribution of well-rounded sublattices of \(\mathbb Z^2\) ⋮ INTERMEDIATE SUMS ON POLYHEDRA II: BIDEGREE AND POISSON FORMULA ⋮ Convex polytopes and quantization of symplectic manifolds

Cites Work

• Computing the volume is difficult
• Geometric algorithms and combinatorial optimization
• Polytope Volume Computation
• Points entiers dans les polyèdres convexes
• On the Complexity of Computing the Volume of a Polyhedron
• Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix
• A random polynomial-time algorithm for approximating the volume of convex bodies
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing the volume, counting integral points, and exponential sums