/LC.GIF&client=easterncarolinaedu)
Computing the continuous discretely integer-point enumeration in polyhedra / Matthias Beck, Sinai Robins ; with illustrations by David Austin.
| Author/creator | Beck, Matthias |
| Other author | Robins, Sinai. |
| Format | Electronic |
| Edition | Second edition. |
| Publication Info | New York : Springer, [2015] |
| Description | xx, 285 pages : illustrations ; 25 cm |
| Supplemental Content | Full text available from Springer Books |
| Supplemental Content | Full text available from Springer Nature - Springer Mathematics and Statistics eBooks 2015 English International |
| Subjects |
| Series | Undergraduate texts in mathematics, 0172-6056 Undergraduate texts in mathematics. |
| Contents | Part I. 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 -- Part II. Beyond the basics: Finite Fourier analysis. Dedekind sums, the building blocks of lattice-point enumeration. Zonotopes. h-polynomials and h*-polynomials. The decomposition of a polytope into its cones. Euler-Maclaurin summation in R[superscript]d. Solid angles. A discrete version of Green's theorem using elliptic functions. Appendix: Vetex and hyperplane descriptions of polytopes. |
| Bibliography note | Includes bibliographical references (pages 267-277) and index. |
| Access restriction | Available only to authorized users. |
| Technical details | Mode of access: World Wide Web |
| Genre/form | Electronic books. |
| LCCN | 2015942640 |
| ISBN | 9781493929689 (alk. paper) |
| ISBN | 1493929682 (alk. paper) |
Availability
| Library | Location | Call Number | Status | Item Actions |
|---|---|---|---|---|
| Electronic Resources | ✔ Available |