Integral Points in Polytopes

Part of the Universitext book series (UTX)


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.


Rational Function Partition Function Integral Point Integer Point Convex Polytope 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Dipartimento di MatematicaUniversità di Roma “La Sapienza”RomaItaly

Personalised recommendations