Book Details
Search page | Title Index | Author Index
Table of Contents | Preface | Introduction | MARC record | Metadata XML | e-Book PDF (1959 KB)
Alexander Barvinok (University of Michigan, Ann Arbor, USA)
Integer Points in Polyhedra
ISBN print 978-3-03719-052-4, ISBN online 978-3-03719-552-9DOI 10.4171/052
September 2008, 199 pages, softcover, 17.0 x 24.0 cm.
34.00 Euro
This is a self-contained exposition of several core aspects of the theory of rational polyhedra
with a view towards algorithmic applications to efficient counting of integer points,
a problem arising in many areas of pure and applied mathematics. The approach is based
on the consistent development and application of the apparatus of generating functions
and the algebra of polyhedra. Topics range from classical, such as the Euler characteristic,
continued fractions, Ehrhart polynomial, Minkowski Convex Body Theorem, and the Lenstra–
Lenstra–Lovász lattice reduction algorithm, to recent advances such as the Berline–Vergne
local formula.
The text is intended for graduate students and researchers. Prerequisites are a modest background in linear algebra and analysis as well as some general mathematical maturity. Numerous figures, exercises of varying degree of difficulty as well as references to the literature and publicly available software make the text suitable for a graduate course.
Keywords: Algebra of polyhedra, Berline–Vergne local formula, continued fractions, Ehrhart polynomial, Euler characteristic, generating functions, integer points, Lenstra–Lenstra–Lovász lattice reduction algorithm, Minkowski Convex Body Theorem
Further Information
Review in Zentralblatt MATH 1154.52009
BACK TO TOP