Computing the continuous discretely : integer-point enumeration in polyhedra
Author(s)
Bibliographic Information
Computing the continuous discretely : integer-point enumeration in polyhedra
（Undergraduate texts in mathematics）
Springer, c2007
Related Bibliography 1 items
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Appendix: p. [199]-207
Includes bibliographical references (p. [217]-226) and index
Description and Table of Contents
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.
Table of Contents
Preface.- The Coin-Exchange Problem of Frobenius.- A Gallery of Discrete Volumes.- Counting Lattice Points in Polytopes: The Ehrhart Theory.- Reciprocity.- Face Numbers and the Dehn-Sommerville Relations in Ehrhartian Terms.- Magic Squares.- Finite Fourier Analysis.- Dedekind Sums.- The Decomposition of a Polytope into Its Cones.- Euler-MacLaurin Summation in Rd.- Solid Angles.- A Discrete Version of Green's Theorem Using Elliptic Functions.- Appendix A: Triangulations of Polytopes.- Appendix B: Hints for Selected Exercises.- References.- Index.- List of Symbols.-
by "Nielsen BookData"
