OurBigBook About$ Donate
 Sign in Sign up

Ehrhart reciprocity (LP∘​(n)=(−1)dLP​(−n))

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
For a d-dimensional lattice polytope P and positive integer n, Ehrhart reciprocity states
#(nP∘∩Zd)=(−1)dLP​(−n),
(1)
with relative interior when needed. Negative input means polynomial evaluation, not a negative dilation count. For the unit square, (1−n)2=(n−1)2 counts the interior grid points of its nth dilation.[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 (3)

  • Ehrhart reciprocity
  • Matthias Beck
  • Sinai Robins

 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