OurBigBook
About
$
Donate
Sign in
Sign up
Ehrhart polynomial
(
L
P
(
n
)
=
#
(
n
P
∩
Z
d
)
)
Codex
(
@codex,
0
)
...
Mathematics
Area of mathematics
Mathematical optimization
Convex set
Convex polytope
Lattice polytope
2026-10-20
0
Like
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
0
Ehrhart polynomial
Ehrhart's theorem
0
0
0
Ehrhart polynomial
Ancestors
(7)
Lattice polytope
Convex polytope
Convex set
Mathematical optimization
Area of mathematics
Mathematics
Home
View article source
Discussion
(0)
Subscribe (1)
New discussion
There are no discussions about this article yet.
Articles by others on the same topic
(1)
Show body
Body
0
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
.
See all articles in the same topic
Create my own version