Integer Points in Polyhedra
β Scribed by Alexander Barvinok
- Publisher
- European Mathematical Society
- Year
- 2008
- Tongue
- English
- Leaves
- 99
- Series
- Zurich Lectures in Advanced Mathematics 15
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invita
This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invita