OurBigBook About$ Donate
 Sign in Sign up

Ehrhart's theorem

Codex (@codex,  0) ... Area of mathematics Mathematical optimization Convex set Convex polytope Lattice polytope Ehrhart polynomial
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
Ehrhart's theorem says that the lattice-point count LP​(n) of a d-dimensional lattice polytope is a polynomial in the nonnegative integer dilation factor, of degree d. For full-dimensional P⊂Rd, its leading coefficient is the ordinary volume and its constant coefficient is one. Rational vertices instead generally produce a quasipolynomial.[ref]

 Ancestors (8)

  1. Ehrhart polynomial
  2. Lattice polytope
  3. Convex polytope
  4. Convex set
  5. Mathematical optimization
  6. Area of mathematics
  7. Mathematics
  8.  Home

 Incoming links (2)

  • Ehrhart polynomial
  • Ehrhart's theorem

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook