Counting lattice points of rational polyhedra

DOI10.1006/aima.2000.1931zbMath0988.52020OpenAlexW2022786113MaRDI QIDQ1590968

Beifang Chen, Vladimir G. Turaev

Publication date: 23 June 2002

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aima.2000.1931

zbMATH Keywords

generating functionlattice polytopeslattice points in polytopesrational simplexEhrhart polynomials

Mathematics Subject Classification ID

Lattices and convex bodies in (n) dimensions (aspects of discrete geometry) (52C07) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Lattices and convex bodies (number-theoretic aspects) (11H06)

Related Items

Pairings and related symmetry notions

Cites Work

• Unnamed Item
• Unnamed Item
• The Ehrhart polynomial of a lattice polytope
• Points entiers dans les polyèdres convexes
• Weight functions, double reciprocity laws, and volume formulas for lattice polyhedra
• Lattice points in simple polytopes
• Sur un probl?me de g?om?trie diophantienne lin?aire. I. Poly?dres et r?seaux.
• Polynomials Associated with Finite Gell-Complexes