Actions for Computing the continuous discretely [electronic resource] : integer-point enumeration in polyhedra

Email RIS file
Bookmark
Report an Issue

Computing the continuous discretely [electronic resource] : integer-point enumeration in polyhedra / Matthias Beck, Sinai Robins

Author
Beck, Matthias
Published
New York : Springer, [2007]
Copyright Date
©2007
Physical Description
1 volume
Additional Creators
Robins, Sinai and SpringerLink (Online service)
Access Online

Availability

I Want It
I Want It

Finding items...

Series
Contents
1 -- 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 -- 2 -- Finite Fourier Analysis -- Dedekind Sums, the Building Blocks of Lattice-point Enumeration -- The Decomposition of a Polytope into Its Cones -- Euler--Maclaurin Summation in ́ -- Solid Angles -- A Discrete Version of Green's Theorem Using Elliptic Functions
Subject(s)
ISBN
9780387461120
Note
Description based on print version record.
Textbook for undergraduates.
AVAILABLE ONLINE TO AUTHORIZED PSU USERS.
Bibliography Note
Includes bibliographical references (pages [211]-220) and index.
Reproduction Note
Electronic reproduction. Berlin : Springer, 2007. Mode of access: World Wide Web. Available via SpringerLink.
View MARC record | catkey: 4568096