This 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. We encounter here a friendly invitation to the field of "counting integer points in polytopes", 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.

Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra (Undergraduate Texts in Mathematics)

Computers & Technology

Matthias Beck

Computer Science

Springer

Quality Management and Managerialism in Healthcare: A Critical Historical Survey

Sara Melo

PALGRAVE~MACMILLAN

This much-anticipated textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. It weaves a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory.

Sinai Robins

The Art of Proof is designed for a one-semester or two-quarter course. A typical student will have studied calculus (perhaps also linear algebra) with reasonable success. With an artful mixture of chatty style and interesting examples, the student's previous intuitive knowledge is placed on solid intellectual ground. The topics covered include: integers, induction, algorithms, real numbers, rational numbers, modular arithmetic, limits, and uncountable sets. Methods, such as axiom, theorem and proof, are taught while discussing the mathematics rather than in abstract isolation. The book ends with short essays on further topics suitable for seminar-style presentation by small teams of students, either in class or in a mathematics club setting. These include: continuity, cryptography, groups, complex numbers, ordinal number, and generating functions.

The Art of Proof: Basic Training for Deeper Mathematics (Undergraduate Texts in Mathematics)

Biographies & Memoirs

Ross Geoghegan

Arts & Literature

Combinatorial reciprocity is a very interesting phenomenon, which can be described as follows: A polynomial, whose values at positive integers count combinatorial objects of some sort, may give the number of combinatorial objects of a different sort when evaluated at negative integers (and suitably normalized). Such combinatorial reciprocity theorems occur in connections with graphs, partially ordered sets, polyhedra, and more. Using the combinatorial reciprocity theorems as a leitmotif, this book unfolds central ideas and techniques in enumerative and geometric combinatorics. Written in a friendly writing style, this is an accessible graduate textbook with almost 300 exercises, numerous illustrations, and pointers to the research literature. Topics include concise introductions to partially ordered sets, polyhedral geometry, and rational generating functions, followed by highly original chapters on subdivisions, geometric realizations of partially ordered sets, and hyperplane arrangements.

Combinatorial Reciprocity Theorems: An Invitation to Enumerative Geometric Combinatorics (Graduate Studies in Mathematics) (Graduate Studies in Mathematics, 195)

Science & Math

Raman Sanyal

Mathematics

American Mathematical Society

See the best price to sell, buy, or rent books by Matthias Beck. BookScouter helps to compare book prices from 25+ online bookstores and 30+ buyback vendors with a single search.

Books by Matthias Beck