Language:   Search:   Contact
World of
Mathematics
Database
»ZMATH«
MSC 2000
MSC 2010
Reviewer
Service
Subscription
»ZMATH«
ZMATH Database | Simple Search Print
Read more | Try MathML | Hide
Zentralblatt MATH has released its new 2010 interface!

ZMATH Database Simple Search Advanced Search Command Search

Simple Search

Query:
Enter a query and click »Search«...
Format:
Display: entries per page entries
Zbl 1114.52013
Beck, Matthias; Robins, Sinai
Computing the continuous discretely. Integer-point enumeration in polyhedra.
(English)
[B] Undergraduate Texts in Mathematics. New York, NY: Springer. xviii, 226~p. EUR~39.95; \$~49.95; \sterling~25.50 (2007). ISBN 978-0-387-29139-0/hbk; ISBN 978-0-387-46112-0/ebook

Pick's Theorem gives the area of an integral convex polygon in terms of the number of integer points in the interior and the number of integer points on the boundary of the polygon. Intuitively, the number of integer points in a convex $d$-dimensional polytope is a good estimate (the ``discrete volume'') for the $d$-dimensional volume of the polytope. This book is concerned with the mathematics of that connection between the discrete and the continuous, with significance for geometry, number theory and combinatorics. The authors give a coherent and tightly developed picture that encompasses the Frobenius coin-exchange problem, Bernoulli polynomials, Ehrhart polynomials for lattice point enumeration, Dehn-Sommerville relations on numbers of faces of polytopes, magic squares, the Birkhoff-von Neumann polytope, finite Fourier series, Dedekind sums, Brion's Theorem on decomposition of polytopes, Euler-Maclaurin summation, volume via solid angles, and Green's Theorem in the plane. The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the material, exercises, open problems and an extensive bibliography.
[Margaret M. Bayer (Lawrence)]
MSC 2000:
*52B20 Lattice polytopes (convex geometry)
11P21 Lattice points in specified regions
05A15 Combinatorial enumeration problems
11F20 Dedekind eta function, Dedekind sums
11H06 Lattices and convex bodies (number theoretic results)
52-01 Textbooks (convex and discrete geometry)
11-01 Textbooks (number theory)
05-01 Textbooks (combinatorics)
52B05 Combinatorial properties of convex sets

Keywords: convex polytope; generating function; Ehrhart polynomial; volume; Frobenius number; magic square; finite Frobenius series; Dedekind sum; solid angle

Cited in: Zbl 1147.52300

Login Username: Password:

Highlights
Overhang
Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.
Elementary number theory. Primes, congruences, and secrets.

Master Server

Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites



Copyright © 2010 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster