You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This book discusses a famous problem that helped to define the field now known as topology: What is the minimum number of colors required to print a map so that no two adjoining countries have the same color? This problem remained unsolved until the 1950s, when it was finally cracked using a computer. This book discusses the history and mathematics of the problem, as well as the philosophical debate which ensued, regarding the validity of computer generated proofs.
The series is aimed specifically at publishing peer reviewed reviews and contributions presented at workshops and conferences. Each volume is associated with a particular conference, symposium or workshop. These events cover various topics within pure and applied mathematics and provide up-to-date coverage of new developments, methods and applications.
On October 23, 1852, Professor Augustus De Morgan wrote a letter to a colleague, unaware that he was launching one of the most famous mathematical conundrums in history--one that would confound thousands of puzzlers for more than a century. This is the amazing story of how the "map problem" was solved. The problem posed in the letter came from a former student: What is the least possible number of colors needed to fill in any map (real or invented) so that neighboring counties are always colored differently? This deceptively simple question was of minimal interest to cartographers, who saw little need to limit how many colors they used. But the problem set off a frenzy among professional mat...
This book describes the construction and the properties of CW-complexes. These spaces are important because firstly they are the correct framework for homotopy theory, and secondly most spaces that arise in pure mathematics are of this type. The authors discuss the foundations and also developments, for example, the theory of finite CW-complexes, CW-complexes in relation to the theory of fibrations, and Milnor's work on spaces of the type of CW-complexes. They establish very clearly the relationship between CW-complexes and the theory of simplicial complexes, which is developed in great detail. Exercises are provided throughout the book; some are straightforward, others extend the text in a non-trivial way. For the latter; further reference is given for their solution. Each chapter ends with a section sketching the historical development. An appendix gives basic results from topology, homology and homotopy theory. These features will aid graduate students, who can use the work as a course text. As a contemporary reference work it will be essential reading for the more specialized workers in algebraic topology and homotopy theory.
This book examines the processes of adaptation across a number of intriguing case studies and media. Turning its attention from the 'what' to the 'how' of adaptation, it serves to re-situate the discourse of adaptation studies, moving away from the hypotheses that used to haunt it, such as fidelity, to questions of how texts, authors and other creative practitioners (always understood as a plurality) engage in dialogue with one another across cultures, media, languages, genders and time itself. With fifteen chapters across fields including fine art and theory, drama and theatre, and television, this interdisciplinary volume considers adaptation across the creative and performance arts, with a single focus on the collaborative.
The solitaire game “The Tower of Hanoi" was invented in the 19th century by the French number theorist Édouard Lucas. The book presents its mathematical theory and offers a survey of the historical development from predecessors up to recent research. In addition to long-standing myths, it provides a detailed overview of the essential mathematical facts with complete proofs, and also includes unpublished material, e.g., on some captivating integer sequences. The main objects of research today are the so-called Hanoi graphs and the related Sierpiński graphs. Acknowledging the great popularity of the topic in computer science, algorithms, together with their correctness proofs, form an esse...
The Nuremberg trials were a series of military tribunals held after World War II by the Allied forces under international law and the laws of war. The trials were most notable for the prosecution of prominent members of the political, military, judicial, and economic leadership of Nazi Germany, who planned, carried out, or otherwise participated in the Holocaust and other war crimes. The trials were held in Nuremberg, Germany. This volume contains trial proceedings from 20 February 1946 to7 March 1946.