Student Mathematical Library – serie

We have been curious about numbers - and prime numbers - since antiquity. One notable new direction this century in the study of primes has been the influx of ideas from probability. The goal of this book is to provide insights into the prime numbers and to describe how a sequence so tautly determined can incorporate such a striking amount of randomness. There are two ways in which the book is exceptional. First, some familiar topics are covered with refreshing insight and/or from new points of view. Second, interesting recent developments and ideas are presented that shed new light on the prime numbers and their distribution among the rest of the integers. The book begins with a chapter covering some classic topics, such as quadratic residues and the Sieve of Eratosthenes. Also discussed are other sieves, primes in cryptography, twin primes, and more.Two separate chapters address the asymptotic distribution of prime numbers. In the first of these, the familiar link between $\zeta(s)$ and the distribution of primes is covered with remarkable efficiency and intuition. The later chapter presents a walk through an elementary proof of the Prime Number Theorem. To help the novice understand the 'why' of the proof, connections are made along the way with more familiar results such as Stirling's formula. A most distinctive chapter covers the stochastic properties of prime numbers. The authors present a wonderfully clever interpretation of primes in arithmetic progressions as a phenomenon in probability. They also describe Cramer's model, which provides a probabilistic intuition for formulating conjectures that have a habit of being true.In this context, they address interesting questions about equipartition modulo $1$ for sequences involving prime numbers. The final section of the chapter compares geometric visualizations of random sequences with the visualizations for similar sequences derived from the primes. The resulting pictures are striking and illuminating. The book concludes with a chapter on the outstanding big conjectures about prime numbers. This book is suitable for anyone who has had a little number theory and some advanced calculus involving estimates. Its engaging style and invigorating point of view will make refreshing reading for advanced undergraduates through research mathematicians. This book is the English translation of the French edition.

'In this book, we try to display the value (and joy!) of starting from a mathematically amorphous problem and combining ideas from diverse sources to produce new and significant mathematics - mathematics unforeseen from the motivating problem...' - from the Preface. The common thread throughout this book is aperiodic tilings; the best-known example is the 'kite and dart' tiling. This tiling has been widely discussed, particularly since 1984 when it was adopted to model quasicrystals. The presentation uses many different areas of mathematics and physics to analyze the new features of such tilings.Although many people are aware of the existence of aperiodic tilings, and maybe even their origin in a question in logic, not everyone is familiar with their subtleties and the underlying rich mathematical theory. For the interested reader, this book fills that gap. Understanding this new type of tiling requires an unusual variety of specialties, including ergodic theory, functional analysis, group theory and ring theory from mathematics, and statistical mechanics and wave diffraction from physics. This interdisciplinary approach also leads to new mathematics seemingly unrelated to the tilings. Included are many worked examples and a large number of figures. The book's multidisciplinary approach and extensive use of illustrations make it useful for a broad mathematical audience.

This volume is based on classes in probability for advanced undergraduates held at the IAS/Park City Mathematics Institute (Utah). It is derived from both lectures (Chapters 1-10) and computer simulations (Chapters 11-13) that were held during the program. The material is coordinated so that some of the major computer simulations relate to topics covered in the first ten chapters. The goal is to present topics that are accessible to advanced undergraduates, yet are areas of current research in probability. The combination of the lucid yet informal style of the lectures and the hands-on nature of the simulations allows readers to become familiar with some interesting and active areas of probability. The first four chapters discuss random walks and the continuous limit of random walks: Brownian motion.Chapters 5 and 6 consider the fascinating mathematics of card shuffles, including the notions of random walks on a symmetric group and the general idea of random permutations. Chapters 7 and 8 discuss Markov chains, beginning with a standard introduction to the theory. Chapter 8 addresses the recent important application of Markov chains to simulations of random systems on large finite sets: Markov Chain Monte Carlo. Random walks and electrical networks are covered in Chapter 9. Uniform spanning trees, as connected to probability and random walks, are treated in Chapter 10. The final three chapters of the book present simulations. Chapter 11 discusses simulations for random walks.Chapter 12 covers simulation topics such as sampling from continuous distributions, random permutations, and estimating the number of matrices with certain conditions using Markov Chain Monte Carlo. Chapter 13 presents simulations of stochastic differential equations for applications in finance. (The simulations do not require one particular piece of software. They can be done in symbolic computation packages or via programming languages such as C.) The volume concludes with a number of problems ranging from routine to very difficult. Of particular note are problems that are typical of simulation problems given to students by the authors when teaching undergraduate probability.

This book is based on an undergraduate course taught at the IAS/Park City Mathematics Institute (Utah) on linear and nonlinear waves. The first part of the text overviews the concept of a wave, describes one-dimensional waves using functions of two variables, provides an introduction to partial differential equations, and discusses computer-aided visualization techniques. The second part of the book discusses traveling waves, leading to a description of solitary waves and soliton solutions of the Klein-Gordon and Korteweg-deVries equations. The wave equation is derived to model the small vibrations of a taut string, and solutions are constructed via d'Alembert's formula and Fourier series.The last part of the book discusses waves arising from conservation laws. After deriving and discussing the scalar conservation law, its solution is described using the method of characteristics, leading to the formation of shock and rarefaction waves. Applications of these concepts are then given for models of traffic flow. The intent of this book is to create a text suitable for independent study by undergraduate students in mathematics, engineering, and science. The content of the book is meant to be self-contained, requiring no special reference material. Access to computer software such as MathematicaR, MATLABR, or MapleR is recommended, but not necessary. Scripts for MATLAB applications will be available via the Web. Exercises are given within the text to allow further practice with selected topics.

We learn by doing. We learn mathematics by doing problems. This book is the first volume of a series of books of problems in mathematical analysis. It is mainly intended for students studying the basic principles of analysis. However, given its organization, level, and selection of problems, it would also be an ideal choice for tutorial or problem-solving seminars, particularly those geared toward the Putnam exam. The volume is also suitable for self-study. Each section of the book begins with relatively simple exercises, yet may also contain quite challenging problems. Very often several consecutive exercises are concerned with different aspects of one mathematical problem or theorem.This presentation of material is designed to help student comprehension and to encourage them to ask their own questions and to start research. The collection of problems in the book is also intended to help teachers who wish to incorporate the problems into lectures. Solutions for all the problems are provided. The book covers three topics: real numbers, sequences, and series, and is divided into two parts: exercises and/or problems, and solutions. Specific topics covered in this volume include the following: basic properties of real numbers, continued fractions, monotonic sequences, limits of sequences, Stolz's theorem, summation of series, tests for convergence, double series, arrangement of series, Cauchy product, and infinite products. Also available from the AMS are ""Problems in Mathematical Analysis II"" and ""Problems in Analysis III"" in the ""Student Mathematical Library"" series.

We learn by doing. We learn mathematics by doing problems. And we learn more mathematics by doing more problems. This is the sequel to ""Problems in Mathematical Analysis I"" (Volume 4 in the ""Student Mathematical Library"" series). If you want to hone your understanding of continuous and differentiable functions, this book contains hundreds of problems to help you do so. The emphasis here is on real functions of a single variable. The topics include: continuous functions, the intermediate value property, uniform continuity, mean value theorems, Taylors formula, convex functions, sequences and series of functions. The book is mainly geared toward students studying the basic principles of analysis.However, given its selection of problems, organization, and level, it would be an ideal choice for tutorial or problem-solving seminars, particularly those geared toward the Putnam exam. It is also suitable for self-study. The presentation of the material is designed to help student comprehension, to encourage them to ask their own questions, and to start research. The collection of problems will also help teachers who wish to incorporate problems into their lectures. The problems are grouped into sections according to the methods of solution. Solutions for the problems are provided. This is the sequel to ""Problems in Mathematical Analysis I"" (Volume 4 in the ""Student Mathematical Library"" series). Also available from the AMS is ""Problems in Analysis III"".

Nature tries to minimize the surface area of a soap film through the action of surface tension. The process can be understood mathematically by using differential geometry, complex analysis, and the calculus of variations. This book employs ingredients from each of these subjects to tell the mathematical story of soap films. The text is fully self-contained, bringing together a mixture of types of mathematics along with a bit of the physics that underlies the subject.The development is primarily from first principles, requiring no advanced background material from either mathematics or physics. Through the MapleR applications, the reader is given tools for creating the shapes that are being studied. Thus, you can 'see' a fluid rising up an inclined plane, create minimal surfaces from complex variables data, and investigate the 'true' shape of a balloon. Oprea also includes descriptions of experiments and photographs that let you see real soap films on wire frames. The theory of minimal surfaces is a beautiful subject, which naturally introduces the reader to fascinating, yet accessible, topics in mathematics. Oprea's presentation is rich with examples, explanations, and applications. It would make an excellent text for a senior seminar or for independent study by upper-division mathematics or science majors.

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.

The study of the zeroes of polynomials, which for one variable is essentially algebraic, becomes a geometric theory for several variables. In this book, Fischer looks at the classic entry point to the subject: plane algebraic curves. Here one quickly sees the mix of algebra and geometry, as well as analysis and topology, that is typical of complex algebraic geometry, but without the need for advanced techniques from commutative algebra or the abstract machinery of sheaves and schemes. In the first half of this book, Fischer introduces some elementary geometrical aspects, such as tangents, singularities, inflection points, and so on.The main technical tool is the concept of intersection multiplicity and Bezout's theorem. This part culminates in the beautiful Plucker formulas, which relate the various invariants introduced earlier. The second part of the book is essentially a detailed outline of modern methods of local analytic geometry in the context of complex curves. This provides the stronger tools needed for a good understanding of duality and an efficient means of computing intersection multiplicities introduced earlier. Thus, we meet rings of power series, germs of curves, and formal parametrizations. Finally, through the patching of the local information, a Riemann surface is associated to an algebraic curve, thus linking the algebra and the analysis.Concrete examples and figures are given throughout the text, and when possible, procedures are given for computing by using polynomials and power series. Several appendices gather supporting material from algebra and topology and expand on interesting geometric topics. This is an excellent introduction to algebraic geometry, which assumes only standard undergraduate mathematical topics: complex analysis, rings and fields, and topology. Reading this book will help the student establish the appropriate geometric intuition that lies behind the more advanced ideas and techniques used in the study of higher dimensional varieties. This is the English translation of a German work originally published by Vieweg Verlag (Wiesbaden, Germany).

This title is suitable for undergraduate and graduate students interested in ordinary differential equations and numerical methods. This book provides a conceptual introduction to the theory of ordinary differential equations, concentrating on the initial value problem for equations of evolution and with applications to the calculus of variations and classical mechanics, along with a discussion of chaos theory and ecological models. It has a careful introduction to the theory of numerical methods with an unusual treatment of the analysis of errors and stability of various numerical solution algorithms. While the book would be suitable as a textbook for an undergraduate or elementary graduate course in ordinary differential equations, the authors have designed the text also to be useful for motivated students wishing to learn the material on their own or desiring to supplement an ODE textbook being used in a course they are taking with a text offering a more conceptual approach to the subject.

This English translation of a Russian book presents the basic notions of differential and algebraic topology, which are indispensable for specialists and useful for research mathematicians and theoretical physicists. In particular, ideas and results are introduced related to manifolds, cell spaces, coverings and fibrations, homotopy groups, intersection index, etc. The author notes, 'The lecture note origins of the book left a significant imprint on its style. It contains very few detailed proofs: I tried to give as many illustrations as possible and to show what really occurs in topology, not always explaining why it occurs'. He concludes, 'As a rule, only those proofs (or sketches of proofs) that are interesting per se and have important generalizations are presented'.

When information is transmitted, errors are likely to occur. This problem has become increasingly important as tremendous amounts of information are transferred electronically every day. Coding theory examines efficient ways of packaging data so that these errors can be detected, or even corrected. The traditional tools of coding theory have come from combinatorics and group theory. Since the work of Goppa in the late 1970s, however, coding theorists have added techniques from algebraic geometry to their toolboxes. In particular, by re-interpreting the Reed-Solomon codes as coming from evaluating functions associated to divisors on the projective line, one can see how to define new codes based on other divisors or on other algebraic curves. For instance, using modular curves over finite fields, Tsfasman, Vladut, and Zink showed that one can define a sequence of codes with asymptotically better parameters than any previously known codes. This monograph is based on a series of lectures the author gave as part of the IAS/PCMI program on arithmetic algebraic geometry. Here, the reader is introduced to the exciting field of algebraic geometric coding theory. Presenting the material in the same conversational tone of the lectures, the author covers linear codes, including cyclic codes, and both bounds and asymptotic bounds on the parameters of codes. Algebraic geometry is introduced, with particular attention given to projective curves, rational functions and divisors. The construction of algebraic geometric codes is given, and the Tsfasman-Vladut-Zink result mentioned above is discussed. No previous experience in coding theory or algebraic geometry is required. Some familiarity with abstract algebra, in particular finite fields, is assumed. However, this material is reviewed in two appendices. There is also an appendix containing projects that explore other codes not covered in the main text.

It is rarely taught in undergraduate or even graduate curricula that the only conformal maps in Euclidean space of dimension greater than two are those generated by similarities and inversions in spheres. This is in stark contrast to the wealth of conformal maps in the plane. This fact is taught in most complex analysis courses. The principal aim of this text is to give a treatment of this paucity of conformal maps in higher dimensions. The exposition includes both an analytic proof, due to Nevanlinna, in general dimension and a differential geometric proof in dimension three. For completeness, enough complex analysis is developed to prove the abundance of conformal maps in the plane.In addition, the book develops inversion theory as a subject, along with the auxiliary theme of circle-preserving maps. A particular feature is the inclusion of a paper by Caratheodory with the remarkable result that any circle-preserving transformation is necessarily a Mobius transformation - not even the continuity of the transformation is assumed. The text is at the level of advanced undergraduates and is suitable for a capstone course, topics course, senior seminar or as an independent study text. Students and readers with university courses in differential geometry or complex analysis bring with them background to build on, but such courses are not essential prerequisites.

Welcome to diophantine analysis - an area of number theory in which we attempt to discover hidden treasures and truths within the jungle of numbers by exploring rational numbers. Diophantine analysis comprises two different but interconnected domains - diophantine approximation and diophantine equations. This highly readable book brings to life the fundamental ideas and theorems from diophantine approximation, geometry of numbers, diophantine geometry and $p$-adic analysis. Through an engaging style, readers participate in a journey through these areas of number theory. Each mathematical theme is presented in a self-contained manner and is motivated by very basic notions. The reader becomes an active participant in the explorations, as each module includes a sequence of numbered questions to be answered and statements to be verified. Many hints and remarks are provided to be freely used and enjoyed.Each module then closes with a Big Picture Question that invites the reader to step back from all the technical details and take a panoramic view of how the ideas at hand fit into the larger mathematical landscape. This book enlists the reader to build intuition, develop ideas and prove results in a very user-friendly and enjoyable environment. Little background is required and a familiarity with number theory is not expected. All that is needed for most of the material is an understanding of calculus and basic linear algebra together with the desire and ability to prove theorems. The minimal background requirement combined with the author's fresh approach and engaging style make this book enjoyable and accessible to second-year undergraduates, and even advanced high school students. The author's refreshing new spin on more traditional discovery approaches makes this book appealing to any mathematician and/or fan of number theory.

The main notions of set theory (cardinals, ordinals, transfinite induction) are fundamental to all mathematicians, not only to those who specialize in mathematical logic or set-theoretic topology. Basic set theory is generally given a brief overview in courses on analysis, algebra, or topology, even though it is sufficiently important, interesting, and simple to merit its own dedicated treatment.This book provides just that in the form of a leisurely exposition for a diversified audience. It is suitable for a broad range of readers, from undergraduate students to professional mathematicians who want to finally find out what transfinite induction is and why it is always replaced by Zorn's Lemma. The text introduces all main subjects of ""naive"" (nonaxiomatic) set theory: functions, cardinalities, ordered and well-ordered sets, transfinite induction and its applications, ordinals, and operations on ordinals. Included are discussions and proofs of the Cantor-Bernstein Theorem, Cantor's diagonal method, Zorn's Lemma, Zermelo's Theorem, and Hamel bases. With over 150 problems, the book is a complete and accessible introduction to the subject.

In 1936, before the development of modern computers, Alan Turing proposed the concept of a machine that would embody the interaction of mind, machine, and logical instruction. The idea of a 'universal machine' inspired the notion of programs stored in a computer's memory. Nowadays, the study of computable functions is a core topic taught to mathematics and computer science undergraduates. Based on the lectures for undergraduates at Moscow State University, this book presents a lively and concise introduction to the central facts and basic notions of the general theory of computation.It begins with the definition of a computable function and an algorithm and discusses decidability, enumerability, universal functions, numberings and their properties, $m$-completeness, the fixed point theorem, arithmetical hierarchy, oracle computations, and degrees of unsolvability. The authors complement the main text with over 150 problems. They also cover specific computational models, such as Turing machines and recursive functions. The intended audience includes undergraduate students majoring in mathematics or computer science, and all mathematicians and computer scientists who would like to learn basics of the general theory of computation. The book is also an ideal reference source for designing a course.

There have been many wonderful developments in the theory of minimal surfaces and geometric measure theory in the past 25 to 30 years. Many of the researchers who have produced these excellent results were inspired by this little book - or by Fred Almgren himself. The book is indeed a delightful invitation to the world of variational geometry. A central topic is Plateau's Problem, which is concerned with surfaces that model the behavior of soap films.When trying to resolve the problem, however, one soon finds that smooth surfaces are insufficient: Varifolds are needed. With varifolds, one can obtain geometrically meaningful solutions without having to know in advance all their possible singularities. This new tool makes possible much exciting new analysis and many new results. Plateau's problem and varifolds live in the world of geometric measure theory, where differential geometry and measure theory combine to solve problems which have variational aspects. The author's hope in writing this book was to encourage young mathematicians to study this fascinating subject further. Judging from the success of his students, it achieves this exceedingly well.

It is remarkable that so much about Lie groups could be packed into this small book. But after reading it, students will be well-prepared to continue with more advanced, graduate-level topics in differential geometry or the theory of Lie groups. The theory of Lie groups involves many areas of mathematics: algebra, differential geometry, algebraic geometry, analysis, and differential equations. In this book, Arvanitoyeorgos outlines enough of the prerequisites to get the reader started. He then chooses a path through this rich and diverse theory that aims for an understanding of the geometry of Lie groups and homogeneous spaces. In this way, he avoids the extra detail needed for a thorough discussion of representation theory. Lie groups and homogeneous spaces are especially useful to study in geometry, as they provide excellent examples where quantities (such as curvature) are easier to compute.A good understanding of them provides lasting intuition, especially in differential geometry. The author provides several examples and computations. Topics discussed include the classification of compact and connected Lie groups, Lie algebras, geometrical aspects of compact Lie groups and reductive homogeneous spaces, and important classes of homogeneous spaces, such as symmetric spaces and flag manifolds. Applications to more advanced topics are also included, such as homogeneous Einstein metrics, Hamiltonian systems, and homogeneous geodesics in homogeneous spaces. The book is suitable for advanced undergraduates, graduate students, and research mathematicians interested in differential geometry and neighboring fields, such as topology, harmonic analysis, and mathematical physics.

This is a genuine introduction to algebraic geometry. The author makes no assumption that readers know more than can be expected of a good undergraduate. He introduces fundamental concepts in a way that enables students to move on to a more advanced book or course that relies more heavily on commutative algebra. The language is purposefully kept on an elementary level, avoiding sheaf theory and cohomology theory. The introduction of new algebraic concepts is always motivated by a discussion of the corresponding geometric ideas. The main point of the book is to illustrate the interplay between abstract theory and specific examples. The book contains numerous problems that illustrate the general theory.The text is suitable for advanced undergraduates and beginning graduate students. It contains sufficient material for a one-semester course. The reader should be familiar with the basic concepts of modern algebra. A course in one complex variable would be helpful, but is not necessary. It is also an excellent text for those working in neighboring fields (algebraic topology, algebra, Lie groups, etc.) who need to know the basics of algebraic geometry.

Learning about cryptography requires examining fundamental issues about information security. Questions abound, ranging from 'From whom are we protecting ourselves?' and 'How can we measure levels of security?' to 'What are our opponent's capabilities?' and 'What are their goals?' Answering these questions requires an understanding of basic cryptography. This book, written by Russian cryptographers, explains those basics.Chapters are independent and can be read in any order. The introduction gives a general description of all the main notions of modern cryptography: a cipher, a key, security, an electronic digital signature, a cryptographic protocol, etc. Other chapters delve more deeply into this material. The final chapter presents problems and selected solutions from ""Cryptography Olympiads for (Russian) High School Students"". This is an English translation of a Russian textbook. It is suitable for advanced high school students and undergraduates studying information security. It is also appropriate for a general mathematical audience interested in cryptography. Also on cryptography and available from the AMS is ""Codebreakers: Ame Beurling and the Swedish Crypto Program during World War II"".

The best way to penetrate the subtleties of the theory of integration is by solving problems. This book, like its two predecessors, is a wonderful source of interesting and challenging problems. As a resource, it is unequaled. It offers a much richer selection than is found in any current textbook. Moreover, the book includes a complete set of solutions. This is the third volume of ""Problems in Mathematical Analysis"". The topic here is integration for real functions of one real variable.The first chapter is devoted to the Riemann and the Riemann-Stieltjes integrals. Chapter 2 deals with Lebesgue measure and integration. The authors include some famous, and some not so famous, inequalities related to Riemann integration. Many of the problems for Lebesgue integration concern convergence theorems and the interchange of limits and integrals. The book closes with a section on Fourier series, with a concentration on Fourier coefficients of functions from particular classes and on basic theorems for convergence of Fourier series.The book is mainly geared toward students studying the basic principles of analysis. However, given its selection of problems, organization, and level, it would be an ideal choice for tutorial or problem-solving seminars, particularly those geared toward the Putnam exam. It is also suitable for self-study. The presentation of the material is designed to help student comprehension, to encourage them to ask their own questions, and to start research. The collection of problems will also help teachers who wish to incorporate problems into their lectures. The problems are grouped into sections according to the methods of solution. Solutions for the problems are provided. ""Problems in Mathematical Analysis I and II"" are available as Volumes 4 and 12 in the AMS series, ""Student Mathematical Library"".

This book introduces readers to the language of generating functions, which nowadays, is the main language of enumerative combinatorics. The book starts with definitions, simple properties, and numerous examples of generating functions. It then discusses topics such as formal grammars, generating functions in several variables, partitions and decompositions, and the exclusion-inclusion principle. In the final chapter, the author describes applications to enumeration of trees, plane graphs, and graphs embedded in two-dimensional surfaces. Throughout the book, the author motivates readers by giving interesting examples rather than general theories. It contains numerous exercises to help students master the material. The only prerequisite is a standard calculus course. The book is an excellent text for a one-semester undergraduate course in combinatorics.

The notion of symmetry is important in many disciplines, including physics, art, and music. The modern mathematical way of treating symmetry is through transformation groups. This book offers an easy introduction to these ideas for the relative novice, such as undergraduates in mathematics or even advanced undergraduates in physics and chemistry. The first two chapters provide a warm-up to the material with, for example, a discussion of algebraic operations on the points in the plane and rigid motions in the Euclidean plane. The notions of a transformation group and of an abstract group are then introduced.Group actions, orbits, and invariants are covered in the next chapter. The final chapter gives an elementary exposition of the basic ideas of Sophus Lie about symmetries of differential equations. Throughout the text, examples are drawn from many different areas of mathematics. Plenty of figures are included, and many exercises with hints and solutions will help readers master the material.

Mathematical modelling is a subject without boundaries. It is the means by which mathematics becomes useful to virtually any subject. Moreover, modelling has been and continues to be a driving force for the development of mathematics itself. This book explains the process of modelling real situations to obtain mathematical problems that can be analyzed, thus solving the original problem. The presentation is in the form of case studies, which are developed much as they would be in true applications. In many cases, an initial model is created, then modified along the way. Some cases are familiar, such as the evaluation of an annuity. Others are unique, such as the fascinating situation in which an engineer, armed only with a slide rule, had 24 hours to compute whether a valve would hold when a temporary rock plug was removed from a water tunnel. Each chapter ends with a set of exercises and some suggestions for class projects.Some projects are extensive, as with the explorations of the predator-prey model; others are more modest. The text was designed to be suitable for a one-term course for advanced undergraduates. The selection of topics and the style of exposition reflect this choice. The authors have also succeeded in demonstrating just how enjoyable the subject can be. This is an ideal text for classes on modelling. It can also be used in seminars or as preparation for mathematical modelling competitions.

Perhaps the most famous example of how ideas from modern physics have revolutionized mathematics is the way string theory has led to an overhaul of enumerative geometry, an area of mathematics that started in the eighteen hundreds. Century-old problems of enumerating geometric configurations have now been solved using new and deep mathematical techniques inspired by physics!The book begins with an insightful introduction to enumerative geometry. From there, the goal becomes explaining the more advanced elements of enumerative algebraic geometry. Along the way, there are some crash courses on intermediate topics which are essential tools for the student of modern mathematics, such as cohomology and other topics in geometry. The physics content assumes nothing beyond a first undergraduate course. The focus is on explaining the action principle in physics, the idea of string theory, and how these directly lead to questions in geometry. Once these topics are in place, the connection between physics and enumerative geometry is made with the introduction of topological quantum field theory and quantum cohomology.

Everyone knows some of the basics of probability, perhaps enough to play cards. Beyond the introductory ideas, there are many wonderful results that are unfamiliar to the layman, but which are well within our grasp to understand and appreciate. Some of the most remarkable results in probability are those that are related to limit theorems - statements about what happens when the trial is repeated many times. The most famous of these is the Law of Large Numbers, which mathematicians, engineers, economists, and many others use every day.In this book, Lesigne has made these limit theorems accessible by stating everything in terms of a game of tossing of a coin: heads or tails. In this way, the analysis becomes much clearer, helping establish the reader's intuition about probability. Moreover, very little generality is lost, as many situations can be modelled from combinations of coin tosses. This book is suitable for anyone who would like to learn more about mathematical probability and has had a one-year undergraduate course in analysis.

The calculus of variations is a beautiful subject with a rich history and with origins in the minimization problems of calculus. Although it is now at the core of many modern mathematical fields, it does not have a well-defined place in most undergraduate mathematics curricula. This volume should nevertheless give the undergraduate reader a sense of its great character and importance. Interesting functionals, such as area or energy, often give rise to problems for which the most natural solution occurs by differentiating a one-parameter family of variations of some function.The critical points of the functional are related to the solutions of the associated Euler-Lagrange equation. These differential equations are at the heart of the calculus of variations and its applications to other subjects. Some of the topics addressed in this book are Morse theory, wave mechanics, minimal surfaces, soap bubbles, and modeling traffic flow. All are readily accessible to advanced undergraduates. This book is derived from a workshop sponsored by Rice University. It is suitable for advanced undergraduates, graduate students and research mathematicians interested in the calculus of variations and its applications to other subjects.

How many dimensions does our universe require for a comprehensive physical description? In 1905, Poincare argued philosophically about the necessity of the three familiar dimensions, while recent research is based on 11 dimensions or even 23 dimensions. The notion of dimension itself presented a basic problem to the pioneers of topology. Cantor asked if dimension was a topological feature of Euclidean space. To answer this question, some important topological ideas were introduced by Brouwer, giving shape to a subject whose development dominated the twentieth century. The basic notions in topology are varied and a comprehensive grounding in point-set topology, the definition and use of the fundamental group, and the beginnings of homology theory requires considerable time.The goal of this book is a focused introduction through these classical topics, aiming throughout at the classical result of the Invariance of Dimension. This text is based on the author's course given at Vassar College and is intended for advanced undergraduate students. It is suitable for a semester-long course on topology for students who have studied real analysis and linear algebra. It is also a good choice for a capstone course, senior seminar, or independent study.

This book presents the characteristic zero invariant theory of finite groups acting linearly on polynomial algebras. The author assumes basic knowledge of groups and rings, and introduces more advanced methods from commutative algebra along the way. The theory is illustrated by numerous examples and applications to physics, engineering, numerical analysis, combinatorics, coding theory, and graph theory. A wide selection of exercises and suggestions for further reading makes the book appropriate for an advanced undergraduate or first-year graduate level course.