2009
DOI: 10.4169/193009709x460813
|View full text |Cite
|
Sign up to set email alerts
|

A Bijective Proof for a Theorem of Ehrhart

Abstract: We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection, inclusion-exclusion, and recurrence relations, and we also prove Ehrhart reciprocity using these methods.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2011
2011
2021
2021

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 27 publications
(9 citation statements)
references
References 14 publications
0
9
0
Order By: Relevance
“…Then P I = i∈I P {i} for all ∅ = I ⊆ [r]. As in [15] we observe that (k + d)∆ d−1 = P ∅ = i∈[d] P {i} for all k ≥ 0. Therefore, by inclusion-exclusion,…”
Section: Characteristic Functions and Valuationsmentioning
confidence: 53%
See 1 more Smart Citation
“…Then P I = i∈I P {i} for all ∅ = I ⊆ [r]. As in [15] we observe that (k + d)∆ d−1 = P ∅ = i∈[d] P {i} for all k ≥ 0. Therefore, by inclusion-exclusion,…”
Section: Characteristic Functions and Valuationsmentioning
confidence: 53%
“…Therefore the order of the minimal polynomial of the sequence is dim P as was demonstrated in [15] and is thus in general smaller than |V(P )|.…”
Section: A Multivariate Recursionmentioning
confidence: 83%
“…A detailed proof following the instructions of [6,Section 3.7] is documented in Barco [5]. (See Sam [90] for an alternative approach.) Note that for any polytope ∆, all the faces in its boundary ∂∆ must be convex.…”
Section: Normal Affine Semigroup Rings and Ehrhart Theorymentioning
confidence: 99%
“…Lately there has been a lot of literature on various topics generated by the Ehrhart polynomial and we cite just a few papers and books: [1], [2], [3], [4], [5], [6], [7], [8], [9], [11], [28], [29], and [31].…”
Section: Introductionmentioning
confidence: 99%