Tags
Language
Tags
April 2024
Su Mo Tu We Th Fr Sa
31 1 2 3 4 5 6
7 8 9 10 11 12 13
14 15 16 17 18 19 20
21 22 23 24 25 26 27
28 29 30 1 2 3 4

Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra

Posted By: ChrisRedfield
Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra

Matthias Beck, Sinai Robins - Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra
Published: 2007-07-01 | ISBN: 0387291393, 1441921192 | PDF | 227 pages | 2 MB


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.