Computing the Continuous Discretely, Softcover reprint of hardcover 1st ed. 2007
Integer-point Enumeration in Polyhedra

Undergraduate Texts in Mathematics Series

Authors:

Language: English

Approximative price 47.46 €

In Print (Delivery period: 15 days).

Add to cartAdd to cart
Computing the continuous discretely: integer-point enumeration in polyhedra (paperback) previously published in hardcover (series: undergraduate texts
Publication date:
227 p. · 15.5x23.5 cm · Paperback

Approximative price 42.15 €

Subject to availability at the publisher.

Add to cartAdd to cart
Computing the continuous discretely: integer-point enumeration in polyhedra (Undergraduate texts in mathematics)
Publication date:
226 p. · Hardback

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.

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.-

The authors write with flair and have chosen a unique set of topics

Places a strong emphasis on computational techniques

Contains more than 200 exercises and has been heavily class-tested

Includes hints to selected exercises

Includes supplementary material: sn.pub/extras