Undergraduate Texts in Mathematics – serie

Now available in Open Access, this best-selling textbook for a second course in linear algebra is aimed at undergraduate math majors and graduate students. The fourth edition gives an expanded treatment of the singular value decomposition and its consequences. It includes a new chapter on multilinear algebra, treating bilinear forms, quadratic forms, tensor products, and an approach to determinants via alternating multilinear forms. This new edition also increases the use of the minimal polynomial to provide cleaner proofs of multiple results. Also, over 250 new exercises have been added.The novel approach taken here banishes determinants to the end of the book. The text focuses on the central goal of linear algebra: understanding the structure of linear operators on finite-dimensional vector spaces. The author has taken unusual care to motivate concepts and simplify proofs. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra. Beautiful formatting creates pages with an unusually student-friendly appearance in both print and electronic versions. No prerequisites are assumed other than the usual demand for suitable mathematical maturity. The text starts by discussing vector spaces, linear independence, span, basis, and dimension. The book then deals with linear maps, eigenvalues, and eigenvectors. Inner-product spaces are introduced, leading to the finite-dimensional spectral theorem and its consequences. Generalized eigenvectors are then used to provide insight into the structure of a linear operator.From the reviews of previous editions:Altogether, the text is a didactic masterpiece. — zbMATHThe determinant-free proofs are elegant and intuitive. — American Mathematical MonthlyThe most original linear algebra book to appear in years, it certainly belongs in every undergraduate library — CHOICE

This textbook is designed for a one year course covering the fundamentals of partial differential equations, geared towards advanced undergraduates and beginning graduate students in mathematics, science, engineering, and elsewhere. The exposition carefully balances solution techniques, mathematical rigor, and significant applications, all illustrated by numerous examples. Extensive exercise sets appear at the end of almost every subsection, and include straightforward computational problems to develop and reinforce new techniques and results, details on theoretical developments and proofs, challenging projects both computational and conceptual, and supplementary material that motivates the student to delve further into the subject. No previous experience with the subject of partial differential equations or Fourier theory is assumed, the main prerequisites being undergraduate calculus, both one- and multi-variable, ordinary differential equations, and basic linear algebra. While the classical topics of separation of variables, Fourier analysis, boundary value problems, Green's functions, and special functions continue to form the core of an introductory course, the inclusion of nonlinear equations, shock wave dynamics, symmetry and similarity, the Maximum Principle, financial models, dispersion and solutions, Huygens' Principle, quantum mechanical systems, and more make this text well attuned to recent developments and trends in this active field of contemporary research. Numerical approximation schemes are an important component of any introductory course, and the text covers the two most basic approaches: finite differences and finite elements.

A half-century ago, advanced calculus was a well-de?ned subject at the core of the undergraduate mathematics curriulum. The classic texts of Taylor [19], Buck [1], Widder [21], and Kaplan [9], for example, show some of the ways it was approached. Over time, certain aspects of the course came to be seen as more signi?cant—those seen as giving a rigorous foundation to calculus—and they - came the basis for a new course, an introduction to real analysis, that eventually supplanted advanced calculus in the core. Advanced calculus did not, in the process, become less important, but its role in the curriculum changed. In fact, a bifurcation occurred. In one direction we got c- culus on n-manifolds, a course beyond the practical reach of many undergraduates; in the other, we got calculus in two and three dimensions but still with the theorems of Stokes and Gauss as the goal. The latter course is intended for everyone who has had a year-long introduction to calculus; it often has a name like Calculus III. In my experience, though, it does not manage to accomplish what the old advancedcalculus course did. Multivariable calculusnaturallysplits intothreeparts:(1)severalfunctionsofonevariable,(2)one function of several variables, and (3) several functions of several variables. The ?rst two are well-developed in Calculus III, but the third is really too large and varied to be treated satisfactorily in the time remaining at the end of a semester. To put it another way: Green’s theorem ?ts comfortably; Stokes’ and Gauss’ do not.

This lively introductory text exposes the student to the rewards of a rigorous study of functions of a real variable. In each chapter, informal discussions of questions that give analysis its inherent fascination are followed by precise, but not overly formal, developments of the techniques needed to make sense of  them. By focusing on the unifying themes of approximation and the resolution of paradoxes that arise in the transition from the finite to the infinite, the text turns what could be a daunting cascade of definitions and theorems into a coherent and engaging progression of ideas. Acutely aware of the need for rigor, the student is much better prepared to understand what constitutes a proper mathematical proof and how to write one.Fifteen years of classroom experience with the first edition of Understanding Analysis have solidified and refined the central narrative of the second edition. Roughly 150 new exercises join a selection of the best exercises fromthe first edition, and three more project-style sections have been added. Investigations of Euler’s computation of ζ(2), the Weierstrass Approximation ­ Theorem, and the gamma function are now among the book’s cohort of seminal results serving as motivation and payoff for the beginning student to master the methods of analysis.

From the reviews of the second edition:"This book covers many interesting topics not usually covered in a present day undergraduate course, as well as certain basic topics such as the development of the calculus and the solution of polynomial equations. The fact that the topics are introduced in their historical contexts will enable students to better appreciate and understand the mathematical ideas involved...If one constructs a list of topics central to a history course, then they would closely resemble those chosen here."(David Parrott, Australian Mathematical Society)This third edition includes new chapters on simple groups and combinatorics, and new sections on several topics, including the Poincare conjecture. The book has also been enriched by added exercises.

In this new textbook, acclaimed author John Stillwell presents a lucid introduction to Lie theory suitable for junior and senior level undergraduates. In order to achieve this, he focuses on the so-called "classical groups'' that capture the symmetries of real, complex, and quaternion spaces. These symmetry groups may be represented by matrices, which allows them to be studied by elementary methods from calculus and linear algebra.This naive approach to Lie theory is originally due to von Neumann, and it is now possible to streamline it by using standard results of undergraduate mathematics. To compensate for the limitations of the naive approach, end of chapter discussions introduce important results beyond those proved in the book, as part of an informal sketch of Lie theory and its history.John Stillwell is Professor of Mathematics at the University of San Francisco. He is the author of several highly regarded books published by Springer, including The Four Pillars of Geometry (2005), Elements of Number Theory (2003), Mathematics and Its History (Second Edition, 2002), Numbers and Geometry (1998) and Elements of Algebra (1994).

Linear algebra is the branch of mathematics that has grown from a care­ ful study of the problem of solving systems of linear equations. The ideas that developed in this way have become part of the language of much of higher mathematics. They also provide a framework for appli­ cations of linear algebra to many problems in mathematics, the natural sciences, economics, and computer science. This book is the revised fourth edition of a textbook designed for upper division courses in linear algebra. While it does not presuppose an earlier course, many connections between linear algebra and under­ graduate analysis are worked into the discussion, making it best suited for students who have completed the calculus sequence. For many students, this may be the first course in which proofs of the main results are presented on an equal footing with methods for solving numerical problems. The concepts needed to understand the proofs are shown to emerge naturally from attempts to solve concrete problems. This connection is illustrated by worked examples in almost every section. Many numerical exercises are included, which use all the ideas, and develop important techniques for problem-solving. There are also theoretical exercises, which provide opportunities for students to discover interesting things for themselves, and to write mathematical explanations in a convincing way. Answers and hints for many of the problems are given in the back. Not all answers are given, however, to encourage students to learn how to check their work.

From the reviews of the second edition:"This book covers many interesting topics not usually covered in a present day undergraduate course, as well as certain basic topics such as the development of the calculus and the solution of polynomial equations. The fact that the topics are introduced in their historical contexts will enable students to better appreciate and understand the mathematical ideas involved...If one constructs a list of topics central to a history course, then they would closely resemble those chosen here."(David Parrott, Australian Mathematical Society)This third edition includes new chapters on simple groups and combinatorics, and new sections on several topics, including the Poincare conjecture. The book has also been enriched by added exercises.

This text covers topics in algebraic geometry and commutative algebra with careful attention to their practical and computational aspects. The first four chapters form the core of the book. A comprehensive chart in the Preface illustrates a variety of ways to proceed with the material once these chapters are covered. In addition to the fundamentals of algebraic geometry—the elimination theorem, the extension theorem, the closure theorem and the Nullstellensatz—there are chapters on polynomial and rational functions between varieties, robotics and geometric theorem proving, invariant theory of finite groups, projective algebraic geometry, dimension theory, and progress made over the last decades in computing Gröbner bases.The fifth edition builds on the fourth edition in two main ways. First, a number of typographical errors, found by readers and by the authors since 2018, have been corrected. Second, new material on toric varieties, monomial curves, and other topics of current interest in algebraic geometry has been added. This enhances the opportunities for active learning through new examples, new exercises, and new projects in Appendix D, all supplemented by additional references. The book also includes updated computer algebra material in Appendix C.The book may be used for a first or second course in undergraduate abstract algebra and, with some augmentation perhaps, for beginning graduate courses in algebraic geometry or computational commutative algebra. Prerequisites for the reader include linear algebra and a proof-oriented course. It is assumed that the reader has access to a computer algebra system. Appendix C describes features of Maple™, Mathematica® and SageMath, as well as other systems that are most relevant to the text. Pseudocode is used in the text; Appendix B carefully describes the pseudocode used.From the reviews of previous editions:“…The book gives an introduction to Buchberger’s algorithm with applications to syzygies, Hilbert polynomials, primary decompositions. There is an introduction to classical algebraic geometry with applications to the ideal membership problem, solving polynomial equations and elimination theory. …The book is well-written. …The reviewer is sure that it will be an excellent guide to introduce further undergraduates in the algorithmic aspect of commutative algebra and algebraic geometry.”—Peter Schenzel, zbMATH, 2007“I consider the book to be wonderful. … The exposition is very clear, there are many helpful pictures and there are a great many instructive exercises, some quite challenging … offers the heart and soul of modern commutative and algebraic geometry.”—The American Mathematical Monthly

In this edition two new chapters, 9 and 10, on mathematical finance are added. They are written by Dr. Farid AitSahlia, ancien eleve, who has taught such a course and worked on the research staff of several industrial and financial institutions. The new text begins with a meticulous account of the uncommon vocab­ ulary and syntax of the financial world; its manifold options and actions, with consequent expectations and variations, in the marketplace. These are then expounded in clear, precise mathematical terms and treated by the methods of probability developed in the earlier chapters. Numerous graded and motivated examples and exercises are supplied to illustrate the appli­ cability of the fundamental concepts and techniques to concrete financial problems. For the reader whose main interest is in finance, only a portion of the first eight chapters is a "prerequisite" for the study of the last two chapters. Further specific references may be scanned from the topics listed in the Index, then pursued in more detail.

In its second edition, this textbook offers a fresh approach to matrix and linear algebra. Its blend of theory, computational exercises, and analytical writing projects is designed to highlight the interplay between these aspects of an application. This approach places special emphasis on linear algebra as an experimental science that provides tools for solving concrete problems.The second edition’s revised text discusses applications of linear algebra like graph theory and network modeling methods used in Google’s PageRank algorithm. Other new materials include modeling examples of diffusive processes, linear programming, image processing, digital signal processing, and Fourier analysis. These topics are woven into the core material of Gaussian elimination and other matrix operations; eigenvalues, eigenvectors, and discrete dynamical systems; and the geometrical aspects of vector spaces.Intended for a one-semester undergraduate course without a strict calculus prerequisite, Applied Linear Algebra and Matrix Analysis augments the key elements of linear algebra with a wide choice of optional sections. With the book’s selection of applications and platform-independent assignments, instructors can tailor the curriculum to suit specific interests and ensure students across various disciplines are equipped with the powerful tools of linear algebra.

. . . that departed from the traditional dry-as-dust mathematics textbook. (M. Kline, from the Preface to the paperback edition of Kline 1972) Also for this reason, I have taken the trouble to make a great number of drawings. (Brieskom & Knorrer, Plane algebraic curves, p. ii) . . . I should like to bring up again for emphasis . . . points, in which my exposition differs especially from the customary presentation in the text­ books: 1. Illustration of abstract considerations by means of figures. 2. Emphasis upon its relation to neighboring fields, such as calculus of dif­ ferences and interpolation . . . 3. Emphasis upon historical growth. It seems to me extremely important that precisely the prospective teacher should take account of all of these. (F. Klein 1908, Eng\. ed. p. 236) Traditionally, a rigorous first course in Analysis progresses (more or less) in the following order: limits, sets, '* continuous '* derivatives '* integration. mappings functions On the other hand, the historical development of these subjects occurred in reverse order: Archimedes Cantor 1875 Cauchy 1821 Newton 1665 . ;::: Kepler 1615 Dedekind . ;::: Weierstrass . ;::: Leibniz 1675 Fermat 1638 In this book, with the four chapters Chapter I. Introduction to Analysis of the Infinite Chapter II. Differential and Integral Calculus Chapter III. Foundations of Classical Analysis Chapter IV. Calculus in Several Variables, we attempt to restore the historical order, and begin in Chapter I with Cardano, Descartes, Newton, and Euler's famous Introductio.

. . . that departed from the traditional dry-as-dust mathematics textbook. (M. Kline, from the Preface to the paperback edition of Kline 1972) Also for this reason, I have taken the trouble to make a great number of drawings. (Brieskom & Knorrer, Plane algebraic curves, p. ii) . . . I should like to bring up again for emphasis . . . points, in which my exposition differs especially from the customary presentation in the text­ books: 1. Illustration of abstract considerations by means of figures. 2. Emphasis upon its relation to neighboring fields, such as calculus of dif­ ferences and interpolation . . . 3. Emphasis upon historical growth. It seems to me extremely important that precisely the prospective teacher should take account of all of these. (F. Klein 1908, Eng\. ed. p. 236) Traditionally, a rigorous first course in Analysis progresses (more or less) in the following order: limits, sets, '* continuous '* derivatives '* integration. mappings functions On the other hand, the historical development of these subjects occurred in reverse order: Archimedes Cantor 1875 Cauchy 1821 Newton 1665 . ;::: Kepler 1615 Dedekind . ;::: Weierstrass . ;::: Leibniz 1675 Fermat 1638 In this book, with the four chapters Chapter I. Introduction to Analysis of the Infinite Chapter II. Differential and Integral Calculus Chapter III. Foundations of Classical Analysis Chapter IV. Calculus in Several Variables, we attempt to restore the historical order, and begin in Chapter I with Cardano, Descartes, Newton, and Euler's famous Introductio.

Geometry: A Metric Approach with Models, imparts a real feeling for Euclidean and non-Euclidean (in particular, hyperbolic) geometry. Intended as a rigorous first course, the book introduces and develops the various axioms slowly, and then, in a departure from other texts, continually illustrates the major definitions and axioms with two or three models, enabling the reader to picture the idea more clearly. The second edition has been expanded to include a selection of expository exercises. Additionally, the authors have designed software with computational problems to accompany the text. This software may be obtained from George Parker.

Introductory textbooks on algebraic geometry typically demand a strong mathematical background and can be challenging even for advanced students.  While many excellent texts aim to bridge the gap to mastering this rich field, learners who are new to abstract algebra—or who have never studied it through a geometric lens—still often find the subject inaccessible.  Beginning in Algebraic Geometry achieves a remarkable balance, offering a rigorous and detailed development of algebraic geometry that is nevertheless intended to be readable by students with only a first course in abstract algebra and linear algebra as prerequisites.  Starting from the most fundamental properties of polynomials, the reader is guided one step at a time through affine, projective, and quasiprojective algebraic geometry, with complete justifications along the way of such foundational results as the Nullstellensatz and the Theorem on Fiber Dimensions.Several features of this text ensure that it is accessible to the widest possible audience.  First, the electronic edition is freely available through Open Access.  Furthermore, the authors have skillfully crafted a narrative-driven exposition that reinforces key algebraic concepts (such as quotient rings and modules) and introduces others (such as tensor products and integrality) by developing them within a geometric framework.  Well-integrated examples and beautiful illustrations enhance the learning experience, and the writing balances rigor and intuition to maximize readability.  Each chapter begins with clearly-stated learning objectives, providing students with a roadmap, and key definitions and results are highlighted for ease of reference.  The exercises range from basic to intermediate in difficulty, ensuring sufficient practice without overwhelming the learner.  This textbook is suitable for both classroom instruction and independent learners, and it serves as an excellent entry point into the more advanced texts on algebraic geometry.

The theory of elliptic curves involves a pleasing blend of algebra, geometry, analysis, and number theory. This volume stresses this interplay as it develops the basic theory, thereby providing an opportunity for advanced undergraduates to appreciate the unity of modern mathematics. At the same time, every effort has been made to use only methods and results commonly included in the undergraduate curriculum. This accessibility, the informal writing style, and a wealth of exercises make Rational Points on Elliptic Curves an ideal introduction for students at all levels who are interested in learning about Diophantine equations and arithmetic geometry.Most concretely, an elliptic curve is the set of zeroes of a cubic polynomial in two variables. If the polynomial has rational coefficients, then one can ask for a description of those zeroes whose coordinates are either integers or rational numbers. It is this number theoretic question that is the main subject of Rational Points on Elliptic Curves. Topics covered include the geometry and group structure of elliptic curves, the Nagell–Lutz theorem describing points of finite order, the Mordell–Weil theorem on the finite generation of the group of rational points, the Thue–Siegel theorem on the finiteness of the set of integer points, theorems on counting points with coordinates in finite fields, Lenstra's elliptic curve factorization algorithm, and a discussion of complex multiplication and the Galois representations associated to torsion points. Additional topics new to the second edition include an introduction to elliptic curve cryptography and a brief discussion of the stunning proof of Fermat's Last Theorem by Wiles et al. via the use of elliptic curves.

This undergraduate text is designed for a single-semester introductory course in discrete mathematics. It is aimed at students of mathematics and computer science, as well as problem-solving enthusiasts or anyone with some familiarity with proofs seeking a concise introduction to the subject. The primary goal is to acquaint readers with key structures and ideas in combinatorial and discrete mathematics that will support further study in mathematics and its applications.Requiring minimal prerequisites, the book seeks to build appreciation while offering a clear foundation for developing combinatorial reasoning. Special attention is given to the basics of enumeration and generating functions. Background concepts are presented accessibly, and examples appear early and frequently. When suitable, multiple proofs are provided for the same result, offering insight into mathematical thinking and the interconnectedness of ideas. Each chapter concludes with a selection of exercises spanning a wide range of difficulty, and a collection of hints and solutions is included at the end of the book.

This text gives a rigorous treatment of the foundations of calculus. In contrast to more traditional approaches, infinite sequences and series are placed at the forefront. The approach taken has not only the merit of simplicity, but students are well placed to understand and appreciate more sophisticated concepts in advanced mathematics. The authors mitigate potential difficulties in mastering the material by motivating definitions, results and proofs. Simple examples are provided to illustrate new material and exercises are included at the end of most sections. Noteworthy topics include: an extensive discussion of convergence tests for infinite series, Wallis’s formula and Stirling’s formula, proofs of the irrationality of π and e and a treatment of Newton’s method as a special instance of finding fixed points of iterated functions.

Based on an honors course taught by the author at UC Berkeley, this introduction to undergraduate real analysis gives a different emphasis by stressing the importance of pictures and hard problems. Topics include: a natural construction of the real numbers, four-dimensional visualization, basic point-set topology, function spaces, multivariable calculus via differential forms (leading to a simple proof of the Brouwer Fixed Point Theorem), and a pictorial treatment of Lebesgue theory. Over 150 detailed illustrations elucidate abstract concepts and salient points in proofs. The exposition is informal and relaxed, with many helpful asides, examples, some jokes, and occasional comments from mathematicians, such as Littlewood, Dieudonné, and Osserman. This book thus succeeds in being more comprehensive, more comprehensible, and more enjoyable, than standard introductions to analysis.New to the second edition of Real Mathematical Analysis is a presentation of Lebesgue integration done almost entirely using the undergraph approach of Burkill. Payoffs include: concise picture proofs of the Monotone and Dominated Convergence Theorems, a one-line/one-picture proof of Fubini's theorem from Cavalieri’s Principle, and, in many cases, the ability to see an integral result from measure theory. The presentation includes Vitali’s Covering Lemma, density points — which are rarely treated in books at this level — and the almost everywhere differentiability of monotone functions. Several new exercises now join a collection of over 500 exercises that pose interesting challenges and introduce special topics to the student keen on mastering this beautiful subject.

This book began life as a set of notes that I developed for a course at the University of Washington entitled Introduction to Modern Algebra for Tea- ers. Originally conceived as a text for future secondary-school mathematics teachers, it has developed into a book that could serve well as a text in an - dergraduatecourseinabstractalgebraoracoursedesignedasanintroduction to higher mathematics. This book di?ers from many undergraduate algebra texts in fundamental ways; the reasons lie in the book’s origin and the goals I set for the course. The course is a two-quarter sequence required of students intending to f- ?ll the requirements of the teacher preparation option for our B.A. degree in mathematics, or of the teacher preparation minor. It is required as well of those intending to matriculate in our university’s Master’s in Teaching p- gram for secondary mathematics teachers. This is the principal course they take involving abstraction and proof, and they come to it with perhaps as little background as a year of calculus and a quarter of linear algebra. The mathematical ability of the students varies widely, as does their level of ma- ematical interest.

Cryptography is a key technology in electronic key systems. It is used to keep data secret, digitally sign documents, access control, and so forth. Users therefore should not only know how its techniques work, but they must also be able to estimate their efficiency and security. Based on courses taught by the author, this book explains the basic methods of modern cryptography. It is written for readers with only basic mathematical knowledge who are interested in modern cryptographic algorithms and their mathematical foundation. Several exercises are included following each chapter. This revised and extended edition includes new material on the AES encryption algorithm, the SHA-1 Hash algorithm, on secret sharing, as well as updates in the chapters on factoring and discrete logarithms.

Goals and Emphasis of the Book Mathematicians have begun to find productive ways to incorporate computing power into the mathematics curriculum. There is no attempt here to use computing to avoid doing differential equations and linear algebra. The goal is to make some first ex­ plorations in the subject accessible to students who have had one year of calculus. Some of the sciences are now using the symbol-manipulative power of Mathemat­ ica to make more of their subject accessible. This book is one way of doing so for differential equations and linear algebra. I believe that if a student's first exposure to a subject is pleasant and exciting, then that student will seek out ways to continue the study of the subject. The theory of differential equations and of linear algebra permeates the discussion. Every topic is supported by a statement of the theory. But the primary thrust here is obtaining solutions and information about solutions, rather than proving theorems. There are other courses where proving theorems is central. The goals of this text are to establish a solid understanding of the notion of solution, and an appreciation for the confidence that the theory gives during a search for solutions. Later the student can have the same confidence while personally developing the theory.

This is a small book on algebra where the stress is laid on the structure of ?elds, hence its title. Youwillhearaboutequations,bothpolynomialanddi?erential,andabout the algebraic structure of their solutions. For example, it has been known for centuries how to explicitely solve polynomial equations of degree 2 (Baby- nians, many centuries ago), 3 (Scipione del Ferro, Tartaglia, Cardan, around th 1500a.d.), and even 4 (Cardan, Ferrari,xvi century), using only algebraic operations and radicals (nth roots). However, the case of degree 5 remained unsolved until Abel showed in 1826 that a general equation of degree 5 cannot be solved that way. Soon after that, Galois de?ned the group of a polynomial equation as the group of permutations of its roots (say, complex roots) that preserve all algebraicidentitieswithrationalcoe?cientssatis?edbytheseroots.Examples of such identities are given by the elementary symmetric polynomials, for it is well known that the coe?cients of a polynomial are (up to sign) elementary symmetric polynomials in the roots. In general, all relations are obtained by combining these, but sometimes there are new ones and the group of the equation is smaller than the whole permutation group. Galois understood how this symmetry group can be used to characterize the solvability of the equation. He de?ned the notion of solvable group and showed that if the group of the equation is solvable, then one can express its roots with radicals, and conversely.

This book, together with Linear Algebra, constitutes a curriculum for an algebra program addressed to undergraduates. The separation of the hnear algebra from the other basic algebraic structures fits all existing tendencies affecting undergraduate teaching, and I agree with these tendencies. I have made the present book self contained logically, but it is probably better if students take the linear algebra course before being introduced to the more abstract notions of groups, rings, and fields, and the systematic development of their basic abstract properties. There is of course a little overlap with the book Lin­ ear Algebra, since I wanted to make the present book self contained. I define vector spaces, matrices, and linear maps and prove their basic properties. The present book could be used for a one-term course, or a year's course, possibly combining it with Linear Algebra. I think it is important to do the field theory and the Galois theory, more important, say, than to do much more group theory than we have done here. There is a chapter on finite fields, which exhibit both features from general field theory, and special features due to characteristic p. Such fields have become important in coding theory.

In contemplating the third edition, I have had multiple objectives to achieve. The ?rst and foremost important objective is to maintain the - cessibility and readability of the book to a broad readership with varying mathematical backgrounds and sophistication. More proofs, more graphs, more explanations, and more applications are provided in this edition. The second objective is to update the contents of the book so that the reader stays abreast of new developments in this vital area of mathematics. Recent results on local and global stability of one-dimensional maps are included in Chapters 1, 4, and Appendices A and C. An extension of the Hartman–Grobman Theorem to noninvertible maps is stated in Appendix D. A whole new section on various notions of the asymptoticity of solutions and a recent extension of Perron’s Second Theorem are added to Chapter 8. In Appendix E a detailed proof of the Levin–May Theorem is presented. In Chapters 4 and 5, the reader will ?nd the latest results on the larval– pupal–adult ?our beetle model. The third and ?nal objective is to better serve the broad readership of this book by including most, but certainly not all, of the research areas in di?erence equations. As more work is being published in the Journal of Di?erence Equations and Applications and elsewhere, it became apparent that a whole chapter needed to be dedicated to this enterprise. With the prodding and encouragement of Gerry Ladas, the new Chapter 5 was born.

In this new text, designed for sophomores studying mathematics and computer science, the authors cover the basics of difference equations and some of their applications in computing and in population biology. Each chapter leads to techniques that can be applied by hand to small examples or programmed for larger problems. Along the way, the reader will use linear algebra and graph theory, develop formal power series, solve combinatorial problems, visit Perron—Frobenius theory, discuss pseudorandom number generation and integer factorization, and apply the Fast Fourier Transform to multiply polynomials quickly.The book contains many worked examples and over 250 exercises. While these exercises are accessible to students and have been class-tested, they also suggest further problems and possible research topics.

In this new text, designed for sophomores studying mathematics and computer science, the authors cover the basics of difference equations and some of their applications in computing and in population biology. Each chapter leads to techniques that can be applied by hand to small examples or programmed for larger problems. Along the way, the reader will use linear algebra and graph theory, develop formal power series, solve combinatorial problems, visit Perron—Frobenius theory, discuss pseudorandom number generation and integer factorization, and apply the Fast Fourier Transform to multiply polynomials quickly.The book contains many worked examples and over 250 exercises. While these exercises are accessible to students and have been class-tested, they also suggest further problems and possible research topics.

This is a textbook for a senior-level undergraduate course for math, physics and chemistry majors. This one course can play two different but complimentary roles: it can serve as a capstone course for students finishing their education, and it can serve as motivating story for future study of mathematics. Some textbooks are like a vigorous regular physical training program, preparing people for a wide range of challenges by honing their basic skills thoroughly. Some are like a series of day hikes. This book is more like an intended trek to a particularly beautiful goal. We’ll take the easiest route to the top, and we’ll stop to appreciate local flora as well as distant peaks worthy of the vigorous training one would need to scale them. Advice to the Student: This book was written with many different readers in mind. Some will be mathematics students interested to see a beautiful and powerful application of a “pure” mathematical subject. Some will be students of physics and chemistry curious about the mathematics behind some tools they use, such as spherical harmonics. Because the readership is so varied, no single reader should be put off by occasional digressions aimed at certain other readers.

Many people think there is only one “right” way to teach geometry. For two millennia, the “right” way was Euclid’s way, and it is still good in many respects. But in the 1950s the cry “Down with triangles!” was heard in France and new geometry books appeared, packed with linear algebra but with no diagrams. Was this the new “right” way, or was the “right” way something else again, perhaps transformation groups? In this book, I wish to show that geometry can be developed in four fundamentally different ways, and that all should be used if the subject is to be shown in all its splendor. Euclid-style construction and axiomatics seem the best way to start, but linear algebra smooths the later stages by replacing some tortuous arguments by simple calculations. And how can one avoid projective geometry? It not only explains why objects look the way they do; it also explains why geometry is entangled with algebra. Finally, one needs to know that there is not one geometry, but many, and transformation groups are the best way to distinguish between them. Two chapters are devoted to each approach: The ?rst is concrete and introductory, whereas the second is more abstract. Thus, the ?rst chapter on Euclid is about straightedge and compass constructions; the second is about axioms and theorems. The ?rst chapter on linear algebra is about coordinates; the second is about vector spaces and the inner product.