Computing the continuous discretely : integer-point enumeration in polyhedra
著者
書誌事項
Computing the continuous discretely : integer-point enumeration in polyhedra
(Undergraduate texts in mathematics)
Springer, c2015
2nd ed
- : pbk
大学図書館所蔵 件 / 全1件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Includes bibliographical references (p. 267-277) and index
"Softcover re-print of the Hardcover 2nd edition 2015"--T.p. verso
内容説明・目次
内容説明
This richly illustrated textbook explores the amazing interaction between combinatorics, geometry, number theory, and analysis which arises in the interplay between polyhedra and lattices. Highly accessible to advanced undergraduates, as well as beginning graduate students, this second edition is perfect for a capstone course, and adds two new chapters, many new exercises, and updated open problems. For scientists, this text can be utilized as a self-contained tooling device.
The topics include a friendly invitation to Ehrhart's theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coin-exchange problem, Dedekind sums, solid angles, Euler-Maclaurin summation for polytopes, computational geometry, magic squares, zonotopes, and more.
With more than 300 exercises and open research problems, the reader is an active participant, carried through diverse but tightly woven mathematical fields that are inspired by an innocently elementary question: What are the relationships between the continuous volume of a polytope and its discrete volume?
Reviews of the first edition:
"You owe it to yourself to pick up a copy of Computing the Continuous Discretely to read about a number of interesting problems in geometry, number theory, and combinatorics."
- MAA Reviews
"The book is written as an accessible and engaging textbook, with many examples, historical notes, pithy quotes, commentary integrating the mate
rial, exercises, open problems and an extensive bibliography."
- Zentralblatt MATH
"This beautiful book presents, at a level suitable for advanced undergraduates, 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 Robins have written the perfect text for such a course."
- CHOICE
目次
Preface.- 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.- 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.- Appendix A: Triangulations of Polytopes.- Appendix B: Hints for Selected Exercises.- References.- Index.- List of Symbols.-
「Nielsen BookData」 より