From the reviews of the third edition: "The author’s goal for Mathematics and its History is to provide a “bird’s-eye view of undergraduate mathematics.” (p. vii) In that regard it succeeds admirably. ... Mathematics and its History is a joy to read. The writing is clear, concise and inviting. The style is very different from a traditional text. ... The author has done a wonderful job of tying together the dominant themes of undergraduate mathematics. ... While Stillwell does a wonderful job of tying together seemingly unrelated areas of mathematics, it is possible to read each chapter independently. I would recommend this fine book for anyone who has an interest in the history of mathematics. For those who teach mathematics, it provides lots of information which could easily be used to enrich an opening lecture in most any undergraduate course. It would be an ideal gift for a department’s outstanding major or for the math club president. Pick it up at your peril — it is hard to put down!" (Richard Wilders, MAA Reviews) 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) "The book...is presented in a lively style without unnecessary detail. It is very stimulating and will be appreciated not only by students. Much attention is paid to problems and to the development of mathematics before the end of the nineteenth century... This book brings to the non-specialist interested in mathematics many interesting results. It can be recommended for seminars and will be enjoyed by the broad mathematical community." (European Mathematical Society) "Since Stillwell treats many topics, most mathematicians will learn a lot from this book as well as they will find pleasant and rather clear expositions of custom materials. The book is accessible to students that have already experienced calculus, algebra and geometry and will give them a good account of how the different branches of mathematics interact." (Denis Bonheure, Bulletin of the Belgian Society)

This best-selling textbook for a second course in linear algebra is aimed at undergrad math majors and graduate students. 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 to simplify proofs. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra.
The third edition contains major improvements and revisions throughout the book. More than 300 new exercises have been added since the previous edition. Many new examples have been added to illustrate the key ideas of linear algebra. New topics covered in the book include product spaces, quotient spaces, and dual spaces. Beautiful new formatting creates pages with an unusually pleasant appearance in both print and electronic versions.
No prerequisites are assumed other than the usual demand for suitable mathematical maturity. Thus 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.

This book presents first-year calculus roughly in the order in which it was first discovered. The first two chapters show how the ancient calculations of practical problems led to infinite series, differential and integral calculus and to differential equations. The establishment of mathematical rigour for these subjects in the 19th century for one and several variables is treated in chapters III and IV. Many quotations are included to give the flavor of the history. The text is complemented by a large number of examples, calculations and mathematical pictures and will provide stimulating and enjoyable reading for students, teachers, as well as researchers.

This text covers topics in algebraic geometry and commutative algebra with a strong perspective toward 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—this new edition incorporates several substantial changes, all of which are listed in the Preface. The largest revision incorporates a new Chapter (ten), which presents some of the essentials of progress made over the last decades in computing Gröbner bases. The book also includes current computer algebra material in Appendix C and updated independent projects (Appendix D).
The book may serve as a first or second course in undergraduate abstract algebra and with some supplementation perhaps, for beginning graduate level courses in algebraic geometry or computational 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 Sage, 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.

The Mathematics of Finance has been a hot topic ever since the discovery of the Black-Scholes option pricing formulas in 1973. Unfortunately, there are very few undergraduate textbooks in this area. This book is specifically written for advanced undergraduate or beginning graduate students in mathematics, finance or economics. This book concentrates on discrete derivative pricing models, culminating in a careful and complete derivation of the Black-Scholes option pricing formulas as a limiting case of the Cox-Ross-Rubinstein discrete model. This second edition is a complete rewrite of the first edition with significant changes to the topic organization, thus making the book flow much more smoothly. Several topics have been expanded such as the discussions of options, including the history of options, and pricing nonattainable alternatives. In this edition the material on probability has been condensed into fewer chapters, and the material on the capital asset pricing model has been removed. The mathematics is not watered down, but it is appropriate for the intended audience. Previous knowledge of measure theory is not needed and only a small amount of linear algebra is required. All necessary probability theory is developed throughout the book on a "need-to-know" basis. No background in finance is required, since the book contains a chapter on options.

In this textbook the authors present first-year geometry roughly in the order in which it was discovered. The first five chapters show how the ancient Greeks established geometry, together with its numerous practical applications, while more recent findings on Euclidian geometry are discussed as well. The following three chapters explain the revolution in geometry due to the progress made in the field of algebra by Descartes, Euler and Gauss. Spatial geometry, vector algebra and matrices are treated in chapters 9 and 10. The last chapter offers an introduction to projective geometry, which emerged in the 19th century.
Complemented by numerous examples, exercises, figures and pictures, the book offers both motivation and insightful explanations, and provides stimulating and enjoyable reading for students and teachers alike.

This text covers the parts of contemporary set theory relevant to other areas of pure mathematics. After a review of "naive" set theory, it develops the Zermelo-Fraenkel axioms of the theory before discussing the ordinal and cardinal numbers. It then delves into contemporary set theory, covering such topics as the Borel hierarchy and Lebesgue measure. A final chapter presents an alternative conception of set theory useful in computer science.

"This book is the first volume of a two-volume textbook for undergraduates and is indeed the crystallization of a course offered by the author at the California Institute of Technology to undergraduates without any previous knowledge of number theory. For this reason, the book starts with the most elementary properties of the natural integers. Nevertheless, the text succeeds in presenting an enormous amount of material in little more than 300 pages."--MATHEMATICAL REVIEWS

Aimed at undergraduate mathematics and computer science students, this book is an excellent introduction to a lot of problems of discrete mathematics. It discusses a number of selected results and methods, mostly from areas of combinatorics and graph theory, and it uses proofs and problem solving to help students understand the solutions to problems. Numerous examples, figures, and exercises are spread throughout the book.

These notes were first used in an introductory course team taught by the authors at Appalachian State University to advanced undergraduates and beginning graduates. The text was written with four pedagogical goals in mind: offer a variety of topics in one course, get to the main themes and tools as efficiently as possible, show the relationships between the different topics, and include recent results to convince students that mathematics is a living discipline.

Written by one of the foremost experts in the field, Algebraic Combinatorics is a unique undergraduate textbook that will prepare the next generation of pure and applied mathematicians. The combination of the author's extensive knowledge of combinatorics and classical and practical tools from algebra will inspire motivated students to delve deeply into the fascinating interplay between algebra and combinatorics. Readers will be able to apply their newfound knowledge to mathematical, engineering, and business models. The text is primarily intended for use in a one-semester advanced undergraduate course in algebraic combinatorics, enumerative combinatorics, or graph theory. Prerequisites include a basic knowledge of linear algebra over a field, existence of finite fields, and group theory. The topics in each chapter build on one another and include extensive problem sets as well as hints to selected exercises. Key topics include walks on graphs, cubes and the Radon transform, the Matrix-Tree Theorem, and the Sperner property. There are also three appendices on purely enumerative aspects of combinatorics related to the chapter material: the RSK algorithm, plane partitions, and the enumeration of labeled trees. Richard Stanley is currently professor of Applied Mathematics at the Massachusetts Institute of Technology. Stanley has received several awards including the George Polya Prize in applied combinatorics, the Guggenheim Fellowship, and the Leroy P. Steele Prize for mathematical exposition. Also by the author: Combinatorics and Commutative Algebra, Second Edition, (c) Birkhauser.

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invitation to the field of "counting integer points in polytopes", and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant.

Intended for juniors and seniors majoring in mathematics, as well as anyone pursuing independent study, this book traces the historical development of four different mathematical concepts by presenting readers with the original sources. Each chapter showcases a masterpiece of mathematical achievement, anchored to a sequence of selected primary sources. The authors examine the interplay between the discrete and continuous, with a focus on sums of powers. They then delineate the development of algorithms by Newton, Simpson and Smale. Next they explore our modern understanding of curvature, and finally they look at the properties of prime numbers. The book includes exercises, numerous photographs, and an annotated bibliography.

About this textbook
* Applications covered: optimization, finance, statistical mechanics, birth and death processes, and gambling systems
* Hands-on approach is used via realistic problems demonstrated with examples and numerical simulations
* A wealth of completely solved example problems provide the reader with a sourcebook to follow toward the solution of their own computational problems
* Each chapter ends with a large collection of homework problems illustrating and directing the material
Monte Carlo methods are among the most used and useful computational tools available today, providing efficient and practical algorithims to solve a wide range of scientific and engineering problems. Applications covered in this book include optimization, finance, statistical mechanics, birth and death processes, and gambling systems.
Explorations in Monte Carlo Methods provides a hands-on approach to learning this subject. Each new idea is carefully motivated by a realistic problem, thus leading from questions to theory via examples and numerical simulations. Programming exercises are integrated throughout the text as the primary vehicle for learning the material. Each chapter ends with a large collection of problems illustrating and directing the material.
This book is suitable as a textbook for students of engineering and the sciences, as well as mathematics. The problem-oriented approach makes it ideal for an applied course in basic probability and for a more specialized course in Monte Carlo methods. Topics include probability distributions, counting combinatorial objects, simulated annealing, genetic algorithms, option pricing, gamblers ruin, statistical mechanics, sampling, and random number generation.
Written for:
Undergraduate students in engineering and the sciences, and mathematics; ideal for an applied course in basic probability, as well as a more specialized course in Monte Carlo methods
Keywords:
* Matlab
* algorithims
* histogramming
* markov chain
* probability
* random number generator
* stochastic processes

Uses the "modified Moore method" approach in which examples and proof opportunities are worked into the text in order to encourage students to develop some of the content through their own examples and arguments while they are reading the text
Concentrates on the mathematics underlying the ideas of optimizing linear functions under linear constraints and the algorithms used to solve them
The material progresses at a gentle and inviting pace
Ample examples and exercises are included
This undergraduate textbook is written for a junior/senior level course on linear optimization. Unlike other texts, the treatment allows the use of the "modified Moore method" approach by working examples and proof opportunities into the text in order to encourage students to develop some of the content through their own experiments and arguments while reading the text. Additionally, the focus is on the mathematics underlying the ideas of optimizing linear functions under linear constraints and the algorithms used to solve them. In particular, the author uses the Simplex Algorithm to motivate these concepts. The text progresses at a gentle and inviting pace. The presentation is driven by numerous examples and illustrations. Ample exercises are provided at the end of each chapter for mastering the material. Opportunities for integrating Maple (or similar) software are included in the book. The author’s own WebSim software can be freely downloaded from his website for pedagogical use.
The teacher's version of the text contains solutions embedded within the text, rather than in an appendix. It also has extra material and suggestions for the teacher’s benefit. Junior/senior level undergraduate students will benefit from the book, as will beginning graduate students. Future secondary school mathematics teachers will also find this book useful.
Arizona State University Professor Glenn H. Hurlbert has published nearly 50 articles in graph theory, combinatorics, and optimization, and has been the recipient of numerous teaching and mentoring awards from ASU, the ASU Parents Association, the School of Mathematical and Statistical Sciences, and the Mathematical Association of America.
Content Level » Graduate
Keywords » Convex Geometry - Convexity - Duality - Linear Programming - Networks - Simplex Algorithm - integer optimization - linear optimization - matrix games - modified Moore method