Computing the Continuous Discretely Integer-Point Enumeration in Polyhedra /

• Κύριοι συγγραφείς: Beck, Matthias (Συγγραφέας), Robins, Sinai (Συγγραφέας)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: New York, NY : Springer New York, 2007.
• Θέματα: Mathematics.; Computer mathematics.; Geometry.; Convex geometry.; Discrete geometry.; Number theory.; Discrete mathematics.; Combinatorics.; Discrete Mathematics.; Number Theory.; Convex and Discrete Geometry.; Computational Science and Engineering.

 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 no other book that puts together all of these ideas in one place, this text is truly a service to the mathematical community. We encounter here a friendly invitation to the field of "counting integer points in polytopes," also known as Ehrhart theory, and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant, and the authors' engaging style encourages such participation. The many compelling pictures that accompany the proofs and examples add to the inviting style. For teachers, this text is ideally suited as a capstone course for undergraduate students or as a compelling text in discrete mathematical topics for beginning graduate students. For scientists, this text can be utilized as a quick tooling device, especially for those who want a self-contained, easy-to-read introduction to these topics. . 

 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.