Computing the Ehrhart quasi-polynomial of a rational simplex

DOI10.1090/S0025-5718-06-01836-9zbMath1093.52009arXivmath/0504444OpenAlexW1987679810MaRDI QIDQ5470061

Alexander I. Barvinok

Publication date: 29 May 2006

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math/0504444

zbMATH Keywords

lattice pointsEhrhart quasipolynomialpoly-nomial-time algorithmRational polytope

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Combinatorics in computer science (68R05)

Related Items

Difference dimension quasi-polynomials, Hybrid spectral gradient method for the unconstrained minimization problem, On lattice point counting in \(\varDelta\)-modular polyhedra, On a relation between spectral theory of lens spaces and Ehrhart theory, Counting chemical compositions using Ehrhart quasi-polynomials, Three Ehrhart quasi-polynomials, Higher integrality conditions, volumes and Ehrhart polynomials, Time-dependent Schrödinger equation: statistics of the distribution of Gaussian packets on a metric graph, On the number of integer points in translated and expanded polyhedra, INTERMEDIATE SUMS ON POLYHEDRA: COMPUTATION AND REAL EHRHART THEORY, A Kronecker approximation with a convex constrained optimization method for blind image restoration, Convex constrained optimization for large-scale generalized Sylvester equations, Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra, Rational Ehrhart quasi-polynomials, Residual algorithm for large-scale positive definite generalized eigenvalue problems, Strange expectations and simultaneous cores, A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations, Unnamed Item, INTERMEDIATE SUMS ON POLYHEDRA II: BIDEGREE AND POISSON FORMULA, An efficient adaptive trust-region method for systems of nonlinear equations, Bivariate dimension quasi-polynomials of difference-differential field extensions with weighted basic operators, Ehrhart polynomials of matroid polytopes and polymatroids, Three derivative-free projection methods for nonlinear equations with convex constraints, Convergence analysis for the modified spectral projected subgradient method

Uses Software

• LattE

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing the volume, counting integral points, and exponential sums
• Irrational proofs for three theorems of Stanley
• Lattice invariant valuations on rational polytopes
• Geometric algorithms and combinatorial optimization.
• Pick's theorem and the Todd class of a toric variety
• New bounds in some transference theorems in the geometry of numbers
• Computing the Ehrhart polynomial of a convex lattice polytope
• The Ehrhart polynomial of a lattice polytope
• Effective lattice point counting in rational convex polytopes
• Short rational generating functions for lattice point problems
• A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
• Cycles representing the Todd class of a toric variety