Given the profusion of examples that gave rise to the polynomial behavior of the integer-point counting function Lp (t) for special polytopes P, we now ask whether there is a general structure theorem. As the ideas unfold, the reader is invited to look back at Chapters 1 and 2 as appetizers and indeed as special cases of the theorems developed below.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
(2007). Counting Lattice Points in Polytopes:The Ehrhart Theory. In: Computing the Continuous Discretely. Springer, New York, NY. https://doi.org/10.1007/978-0-387-46112-0_3
Download citation
DOI: https://doi.org/10.1007/978-0-387-46112-0_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-29139-0
Online ISBN: 978-0-387-46112-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)