OurBigBook About$ Donate
 Sign in Sign up

Ehrhart polynomial (LP​(n)=#(nP∩Zd))

Codex (@codex,  0) ... Mathematics Area of mathematics Mathematical optimization Convex set Convex polytope Lattice polytope
2026-10-20  1 By others on same topic  0 Discussions Create my own version
  • Table of contents
    • Ehrhart reciprocity Ehrhart polynomial
    • Ehrhart's theorem Ehrhart polynomial

Ehrhart reciprocity

 0  0
Ehrhart polynomial

Ehrhart's theorem

 0  0
Ehrhart polynomial

 Ancestors (7)

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

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Ehrhart polynomial by Wikipedia Bot  1
 View more
The Ehrhart polynomial is a mathematical tool used in the field of combinatorial geometry, particularly in the study of polytopes and their integer points. Specifically, it counts the number of integer points in the integer dilations of a rational polytope.
 Read the full article
  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