An “accessible and engaging” tool for understanding the branch of mathematics that is so crucial to modern computer science, using real-life problems (Mathematical Reviews). What is the maximum number of pizza slices one can get by making four straight cuts through a circular pizza? How does a computer determine the best set of pixels to represent a straight line on a computer screen? How many people at a minimum does it take to guard an art gallery? Discrete mathematics has the answer to these—and many other—questions of picking, choosing, and shuffling. T. S. Michael’s gem of a book brings this vital but tough-to-teach subject to life using examples from the real world and popular culture. Each chapter uses one problem—such as slicing a pizza—to detail key concepts about counting numbers and arranging finite sets. Michael takes a different perspective in tackling each of eight problems and explains them in differing degrees of generality, showing in the process how the same mathematical concepts appear in varied guises and contexts. In doing so, he imparts a broader understanding of the ideas underlying discrete mathematics and helps readers appreciate and understand mathematical thinking and discovery. This book explains the basic concepts of discrete mathematics and demonstrates how to apply them in largely nontechnical language. The explanations and formulas can be grasped with a basic understanding of linear equations.

Art gallery theorems and algorithms are so called because they relate to problems involving the visibility of geometrical shapes and their internal surfaces. This book explores generalizations and specializations in these areas. Among the presentations are recently discovered theorems on orthogonal polygons, polygons with holes, exterior visibility, visibility graphs, and visibility in three dimensions. The author formulates many open problems and offers several conjectures, providing arguments which may be followed by anyone familiar with basic graph theory and algorithms. This work may be applied to robotics and artificial intelligence as well as other fields, and will be especially useful to computer scientists working with computational and combinatorial geometry.

A best book of the year from New York Public Library, NPR, the Financial Times, Book Riot, and the Sunday Times (London). A fascinating, revelatory portrait of the Metropolitan Museum of Art and its treasures by a former New Yorker staffer who spent a decade as a museum guard. Millions of people climb the grand marble staircase to visit the Metropolitan Museum of Art every year. But only a select few have unrestricted access to every nook and cranny. They’re the guards who roam unobtrusively in dark blue suits, keeping a watchful eye on the two million square foot treasure house. Caught up in his glamorous fledgling career at The New Yorker, Patrick Bringley never thought he’d be one of them. Then his older brother was diagnosed with fatal cancer and he found himself needing to escape the mundane clamor of daily life. So he quit The New Yorker and sought solace in the most beautiful place he knew. To his surprise and the reader’s delight, this temporary refuge becomes Bringley’s home away from home for a decade. We follow him as he guards delicate treasures from Egypt to Rome, strolls the labyrinths beneath the galleries, wears out nine pairs of company shoes, and marvels at the beautiful works in his care. Bringley enters the museum as a ghost, silent and almost invisible, but soon finds his voice and his tribe: the artworks and their creators and the lively subculture of museum guards—a gorgeous mosaic of artists, musicians, blue-collar stalwarts, immigrants, cutups, and dreamers. As his bonds with his colleagues and the art grow, he comes to understand how fortunate he is to be walled off in this little world, and how much it resembles the best aspects of the larger world to which he gradually, gratefully returns. In the tradition of classic workplace memoirs like Lab Girl and Working Stiff, All The Beauty in the World is a surprising, inspiring portrait of a great museum, its hidden treasures, and the people who make it tick, by one of its most intimate observers.

This is an exhibition about the relationship between security guards and the art they protect every day. It shines a light on the perspectives of security officers and offers a collaborative framework for learning about the exhibition process, the security officers' experiences, and provides opportunities for professional growth and mentorship. The exhibition and accompanying catalogue feature works from the BMA collection.

According to the great mathematician Paul Erdös, God maintains perfect mathematical proofs in The Book. This book presents the authors candidates for such "perfect proofs," those which contain brilliant ideas, clever connections, and wonderful observations, bringing new insight and surprising perspectives to problems from number theory, geometry, analysis, combinatorics, and graph theory. As a result, this book will be fun reading for anyone with an interest in mathematics.

This book constitutes the refereed proceedings of the 15th Algorithms and Data Structures Symposium, WADS 2017, held in St. John's, NL, Canada, in July/August 2017. The 49 full papers presented together with 3 abstracts of invited talks were carefully reviewed and selected from 109 submissions. They present original research on the theory and application of algorithms and data structures in many areas, including combinatorics, computational geometry, databases, graphics, and parallel and distributed computing. The WADS Symposium, which alternates with the Scandinavian Symposium and Workshops on Algorithm Theory, SWAT, is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. Papers presenting original research on the theory and application of algorithms and data structures