David (TRN) Kramer

The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints and solutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level. Praise for the German edition ...This book is a well-written introduction to discrete mathematics and is highly recommended to every student of mathematics and computer science as well as to teachers of these topics. --Konrad Engel for MathSciNet Martin Aigner is a professor of mathematics at the Free University of Berlin. He received his PhD at the University of Vienna and has held a number of positions in the USA and Germany before moving to Berlin. He is the author of several books on discrete mathematics, graph theory, and the theory of search.The Monthly article Turan's graph theorem earned him a 1995 Lester R. Ford Prize of the MAA for expository writing, and his book Proofs from the BOOK with Gunter M. Ziegler has been an international success with translations into 12 languages.

Algebraic number theory is one of the most refined creations in mathematics. It has been developed by some of the leading mathematicians of this and previous centuries. The primary goal of this book is to present the essential elements of algebraic number theory, including the theory of normal extensions up through a glimpse of class field theory. Following the example set for us by Kronecker, Weber, Hilbert and Artin, algebraic functions are handled here on an equal footing with algebraic numbers. This is done on the one hand to demonstrate the analogy between number fields and function fields, which is especially clear in the case where the ground field is a finite field.On the other hand, in this way one obtains an introduction to the theory of 'higher congruences' as an important element of 'arithmetic geometry'. Early chapters discuss topics in elementary number theory, such as Minkowski's geometry of numbers, public-key cryptography and a short proof of the Prime Number Theorem, following Newman and Zagier. Next, some of the tools of algebraic number theory are introduced, such as ideals, discriminants and valuations.These results are then applied to obtain results about function fields, including a proof of the Riemann-Roch Theorem and, as an application of cyclotomic fields, a proof of the first case of Fermat's Last Theorem.There are a detailed exposition of the theory of Hecke $L$-series, following Tate, and explicit applications to number theory, such as the Generalized Riemann Hypothesis. Chapter 9 brings together the earlier material through the study of quadratic number fields. Finally, Chapter 10 gives an introduction to class field theory. The book attempts as much as possible to give simple proofs. It can be used by a beginner in algebraic number theory who wishes to see some of the true power and depth of the subject. The book is suitable for two one-semester courses, with the first four chapters serving to develop the basic material. Chapters 6 through 9 could be used on their own as a second semester course.

It all started with von Neumann and Morgenstern half a century ago. Their Theory of Games and Economic Behavior gave birth to a whole new area of mathematics concerned with the formal problems of rational decision as experienced by multiple agents. Now, game theory is all around us, making its way even into regular conversations. In the present book, Mehlmann presents mathematical foundations and concepts illustrated via social quandaries, mock political battles, evolutionary confrontations, economic struggles, and literary conflict. Most of the standard models - the prisoners' dilemma, the arms race, evolution, duels, the game of chicken, etc. - are here.Many non-standard examples are also here: the Legend of Faust, shootouts in the movies, the Madness of Odysseus, to name a few. The author uses familiar formulas, fables, and paradoxes to guide readers through what he calls the 'hall of mirrors of strategic decision-making'. His light-hearted excursion into the world of strategic calculation shows that even deep insights into the nature of strategic thought can be elucidated by games, puzzles, and diversions.Originally written in German and published by Vieweg-Verlag, this AMS edition is a translation tailored for the English-speaking reader.It offers an intriguing look at myths and paradoxes through the lens of game theory, bringing the mathematics into sharper focus at the same time. This book is a must for those who wish to consider game theory from a different perspective: one that embraces science, literature, and real-life conflict. "The Game's Afoot!" would make an excellent book for an undergraduate course in game theory. It can also be used for independent study or as supplementary course reading. The connections to literature, films and everyday life also make it highly suitable as a text for a challenging course for non-majors. Its refreshing style and amusing combination of game theoretic analysis and cultural issues even make it appealing as recreational reading.