Computing the Ehrhart polynomial of a convex lattice polytope
From MaRDI portal
Publication:1330880
DOI10.1007/BF02574364zbMATH Open0804.52009MaRDI QIDQ1330880FDOQ1330880
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
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)
Cites Work
- Title not available (Why is that?)
- Introduction to Toric Varieties. (AM-131)
- Geometric algorithms and combinatorial optimization
- Minkowski's Convex Body Theorem and Integer Programming
- The Minimum Satisfiability Problem
- On the Complexity of Computing the Volume of a Polyhedron
- A graph-theoretical representation of PL-manifolds -- a survey on crystallizations
- Polynomials Associated with Finite Gell-Complexes
- Pick's theorem and the Todd class of a toric variety
- On the number of convex lattice polytopes
- Worst-case greedy matchings in the unitd-cube
Cited In (22)
- Computing the Ehrhart quasi-polynomial of a rational simplex
- Title not available (Why is that?)
- Computing Optimized Path Integrals for Knapsack Feasibility
- The Frobenius problem, rational polytopes, and Fourier-Dedekind sums
- Efficient Algorithms to Test Digital Convexity
- Ehrhart Polynomials and Successive Minima
- Efficiently testing digital convexity and recognizing digital convex polygons
- On the GLY conjecture of upper estimate of positive integral points in real right-angled simplices
- Computing the discrete compactness of orthogonal pseudo-polytopes via their \(n\)D-EVM representation
- An envelope operator for full convexity to define polyhedral models in digital spaces
- Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra
- Solving degenerate sparse polynomial systems faster
- Enumeration of $4 \times 4$ magic squares
- The degree of point configurations: Ehrhart theory, Tverberg points and almost neighborly polytopes
- Ehrhart theory of polytopes and Seiberg-Witten invariants of plumbed 3-manifolds
- Valuations on Lattice Polytopes
- Some Experimental Results on the Frobenius Problem
- Difference dimension quasi-polynomials
- An alternative definition for digital convexity
- An alternative definition for digital convexity
- Bivariate dimension quasi-polynomials of difference-differential field extensions with weighted basic operators
- Sharp polynomial estimate of integral points in right-angled simplices
Recommendations
- On Barvinok's Algorithm for Counting Lattice Points in Fixed Dimension 👍 👎
- Finding the convex hull facet by facet 👍 👎
- On Counting Lattice Points in Polyhedra 👍 👎
- How good are convex hull algorithms? 👍 👎
- Computing the Ehrhart quasi-polynomial of a rational simplex 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: Computing the Ehrhart polynomial of a convex lattice polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1330880)
