Abstract
In this chapter we begin to study the problem of counting the number of integer points in a convex polytope, or the equivalent problem of computing a partition function. We start with the simplest case of numbers. We continue with the theorems of Brion and Ehrhart and leave the general discussion to the next chapters.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
De Concini, C., Procesi, C. (2011). Integral Points in Polytopes. In: Topics in Hyperplane Arrangements, Polytopes and Box-Splines. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-0-387-78963-7_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-78963-7_12
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-78962-0
Online ISBN: 978-0-387-78963-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)