Computing the Ehrhart polynomial of a convex lattice polytope

DOI10.1007/BF02574364zbMath0804.52009MaRDI QIDQ1330880

Alexander I. Barvinok

Publication date: 10 August 1994

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

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

zbMATH Keywords

Ehrhart polynomiallattice polytopesgeometry of numbers

Mathematics Subject Classification ID

Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Parallel algorithms in computer science (68W10) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items (20)

Valuations on Lattice Polytopes ⋮ Difference dimension quasi-polynomials ⋮ On the GLY conjecture of upper estimate of positive integral points in real right-angled simplices ⋮ Some Experimental Results on the Frobenius Problem ⋮ Sharp polynomial estimate of integral points in right-angled simplices ⋮ An envelope operator for full convexity to define polyhedral models in digital spaces ⋮ Computing Optimized Path Integrals for Knapsack Feasibility ⋮ Efficiently testing digital convexity and recognizing digital convex polygons ⋮ Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds ⋮ The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes ⋮ Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra ⋮ An alternative definition for digital convexity ⋮ An alternative definition for digital convexity ⋮ Enumeration of $4 \times 4$ magic squares ⋮ Solving degenerate sparse polynomial systems faster ⋮ Computing the Ehrhart quasi-polynomial of a rational simplex ⋮ Bivariate dimension quasi-polynomials of difference-differential field extensions with weighted basic operators ⋮ Efficient Algorithms to Test Digital Convexity ⋮ Ehrhart Polynomials and Successive Minima ⋮ The Frobenius problem, rational polytopes, and Fourier-Dedekind sums

Cites Work

• Unnamed Item
• A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
• Geometric algorithms and combinatorial optimization
• Pick's theorem and the Todd class of a toric variety
• On the number of convex lattice polytopes
• Introduction to Toric Varieties. (AM-131)
• Worst-case greedy matchings in the unitd-cube
• Minkowski's Convex Body Theorem and Integer Programming
• On the Complexity of Computing the Volume of a Polyhedron
• The Minimum Satisfiability Problem
• Polynomials Associated with Finite Gell-Complexes

This page was built for publication: Computing the Ehrhart polynomial of a convex lattice polytope