Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra
Book information
Description
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 invitation to the field of "counting integer points in polytopes", and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant.
Similar books
Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
2015 · PDF
Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra
2007 · PDF
A Brief History of Ancient Astrology
2006 · PDF
Computing the Continuous Discretely: Integer-Point Enumeration in Polyhedra
2007 · PDF
Computing the continuous discretely: integer-point enumeration in polyhedra
2007 · PDF
Risk and the Politics of Public Health: A Critical Review
2024 · PDF
Fourier Analysis on Polytopes and the Geometry of Numbers (Student Mathematical Library)
2024 · PDF
Fourier Analysis on Polytopes and the Geometry of Numbers. Part I: A Friendly Introduction
2024 · PDF