Computing the Continuous Discretely Integer-point Enumeration in Polyhedra /
This much-anticipated 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. Because there is n...
Clasificación: | Libro Electrónico |
---|---|
Autores principales: | , |
Autor Corporativo: | |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
New York, NY :
Springer New York : Imprint: Springer,
2007.
|
Edición: | 1st ed. 2007. |
Colección: | Undergraduate Texts in Mathematics,
|
Temas: | |
Acceso en línea: | Texto Completo |
Tabla de Contenidos:
- The Essentials of Discrete Volume Computations
- 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
- Beyond the Basics
- Finite Fourier Analysis
- Dedekind Sums, the Building Blocks of Lattice-point Enumeration
- The Decomposition of a Polytope into Its Cones
- Euler-Maclaurin Summation in ?d
- Solid Angles
- A Discrete Version of Green's Theorem Using Elliptic Functions.