Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra
a fairly complete introduction to the problem of counting lattice points inside a convex polyhedron.” — Mathematical Reviews “Many departments recognize the need for capstone courses in which graduating students can see the tools they have acquired come together in some satisfying way. Beck and Robi...
| Main Authors: | , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
New York, NY
Springer New York
2015, 2015
|
| Edition: | 2nd ed. 2015 |
| Series: | Undergraduate Texts in Mathematics
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer eBooks 2005- - Collection details see MPG.ReNa |
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