Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra
Resource Information
The work Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra
Resource Information
The work Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra represents a distinct intellectual or artistic creation found in Boston University Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra
 Title remainder
 IntegerPoint Enumeration in Polyhedra
 Statement of responsibility
 by Matthias Beck, Sinai Robins
 Subject

 Number theory
 Number theory
 Discrete geometry
 Discrete geometry
 Convex geometry
 Number Theory
 Number Theory
 Combinatorial analysis
 Combinatorial analysis
 Mathematics
 Computer science  Mathematics
 Convex and Discrete Geometry
 Convex geometry
 Combinatorics
 Electronic resources
 Combinatorial analysis
 Mathematics
 Discrete geometry
 Combinatorics
 Computer science  Mathematics
 Number theory
 Combinatorics
 Number Theory
 Mathematics
 Computational Science and Engineering
 Computer science  Mathematics
 Convex geometry
 Language
 eng
 Summary
 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 selfcontained tooling device. The topics include a friendly invitation to Ehrhart’s theory of counting lattice points in polytopes, finite Fourier analysis, the Frobenius coinexchange 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
 Image bit depth
 0
 LC call number
 QA164167.2
 Literary form
 non fiction
 Series statement
 Undergraduate Texts in Mathematics,
Context
Context of Computing the Continuous Discretely : IntegerPoint Enumeration in PolyhedraEmbed (Experimental)
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/_TY51cDjQXI/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/_TY51cDjQXI/">Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/resource/_TY51cDjQXI/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/resource/_TY51cDjQXI/">Computing the Continuous Discretely : IntegerPoint Enumeration in Polyhedra</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>