Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /
This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is pe...
| Main Authors: | , |
|---|---|
| Corporate Author: | |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
New York, NY :
Springer New York : Imprint: Springer,
2015.
|
| Series: | Undergraduate Texts in Mathematics,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Table of Contents:
- 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
- Zonotopes
- h-Polynomials and h*-Polynomials
- 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.