東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Computing the continuous discretely ...

Beck, Matthias.

FindBook

Google Book

Amazon

博客來

Computing the continuous discretely = integer-point enumeration in polyhedra /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Computing the continuous discretely/ by Matthias Beck, Sinai Robins.
其他題名:	integer-point enumeration in polyhedra /
作者:	Beck, Matthias.
其他作者:	Robins, Sinai.
出版者:	New York, NY :Springer New York : : 2015.,
面頁冊數:	xx, 285 p. :ill., digital ;24 cm.
內容註:	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 -- Zonotopes -- h-Polynomials and h*-Polynomials -- 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.
Contained By:	Springer eBooks
標題:	Discrete geometry. -
電子資源:	http://dx.doi.org/10.1007/978-1-4939-2969-6
ISBN:	9781493929696

Computing the continuous discretely = integer-point enumeration in polyhedra /
Beck, Matthias.

Computing the continuous discretelyinteger-point enumeration in polyhedra /[electronic resource] :by Matthias Beck, Sinai Robins. - 2nd ed. - New York, NY :Springer New York :2015. - xx, 285 p. :ill., digital ;24 cm. - Undergraduate texts in mathematics,0172-6056. - Undergraduate texts in mathematics..

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 -- Zonotopes -- h-Polynomials and h*-Polynomials -- 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.

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.

ISBN: 9781493929696

Standard No.: 10.1007/978-1-4939-2969-6doiSubjects--Topical Terms:

728299
Discrete geometry.

LC Class. No.: QA640.7

Dewey Class. No.: 516.11

Computing the continuous discretely = integer-point enumeration in polyhedra /
LDR:03537nmm a2200337 a 4500 001 2013468
003 DE-He213
005 20160412105511.0
006 m d
007 cr nn 008maaau
008 160518s2015 nyu s 0 eng d
020 $a 9781493929696 $q (electronic bk.)
020 $a 9781493929689 $q (paper)
024 7 $a 10.1007/978-1-4939-2969-6 $2 doi
035 $a 978-1-4939-2969-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA640.7
072 7 $a PBV $2 bicssc
072 7 $a MAT036000 $2 bisacsh
082 0 4 $a 516.11 $2 23
090 $a QA640.7 $b .B393 2015
100 1 $a Beck, Matthias. $3 1245251
245 1 0 $a Computing the continuous discretely $h [electronic resource] : $b integer-point enumeration in polyhedra / $c by Matthias Beck, Sinai Robins.
250 $a 2nd ed.
260 $a New York, NY : $b Springer New York : $b Imprint: Springer, $c 2015.
300 $a xx, 285 p. : $b ill., digital ; $c 24 cm.
490 1 $a Undergraduate texts in mathematics, $x 0172-6056
505 0 $a 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 -- Zonotopes -- h-Polynomials and h*-Polynomials -- 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.
520 $a 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.
650 0 $a Discrete geometry. $3 728299
650 0 $a Mathematics. $3 515831
650 0 $a Polyhedra. $3 710329
650 0 $a Computer science $x Mathematics. $3 532725
650 2 4 $a Combinatorics. $3 895617
650 2 4 $a Number Theory. $3 891078
650 2 4 $a Convex and Discrete Geometry. $3 893686
650 2 4 $a Computational Science and Engineering. $3 893018
700 1 $a Robins, Sinai. $3 2162901
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
830 0 $a Undergraduate texts in mathematics. $3 1041596
856 4 0 $u http://dx.doi.org/10.1007/978-1-4939-2969-6
950 $a Mathematics and Statistics (Springer-11649)