A First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration—recursion, generating functions, sieve and inversion formulas, enumeration under group actions—and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author's exposition has been strongly influenced by the work of Rota and Stanley, highlighting bijective proofs, partially ordered sets, and an emphasis on organizing the subject under various unifying themes, including the theory of incidence algebras. In addition, there are distinctive chapters on the combinatorics of finite vector spaces, a detailed account of formal power series, and combinatorial number theory. The reader is assumed to have a knowledge of basic linear algebra and some familiarity with power series. There are over 200 well-designed exercises ranging in difficulty from straightforward to challenging. There are also sixteen large-scale honors projects on special topics appearing throughout the text. The author is a distinguished combinatorialist and award-winning teacher, and he is currently Professor Emeritus of Mathematics and Adjunct Professor of Philosophy at the University of Tennessee. He has published widely in number theory, combinatorics, probability, decision theory, and formal epistemology. His Erdős number is 2.

This text introduces students to the theory and practice of differential equations, which are fundamental to the mathematical formulation of problems in physics, chemistry, biology, economics, and other sciences. The book is ideally suited for undergraduate or beginning graduate students in mathematics, and will also be useful for students in the physical sciences and engineering who have already taken a three-course calculus sequence. This second edition incorporates much new material, including sections on the Laplace transform and the matrix Laplace transform, a section devoted to Bessel's equation, and sections on applications of variational methods to geodesics and to rigid body motion. There is also a more complete treatment of the Runge-Kutta scheme, as well as numerous additions and improvements to the original text. Students finishing this book will be well prepare

Many paths lead into Euclidean plane geometry. Geometry Transformed offers an expeditious yet rigorous route using axioms based on rigid motions and dilations. Since transformations are available at the outset, interesting theorems can be proved sooner; and proofs can be connected to visual and tactile intuition about symmetry and motion. The reader thus gains valuable experience thinking with transformations, a skill that may be useful in other math courses or applications. For students interested in teaching mathematics at the secondary school level, this approach is particularly useful since geometry in the Common Core State Standards is based on rigid motions. The only prerequisite for this book is a basic understanding of functions. Some previous experience with proofs may be helpful, but students can also learn about proofs by experiencing them in this book—in a context where they can draw and experiment. The eleven chapters are organized in a flexible way to suit a variety of curriculum goals. In addition to a geometrical core that includes finite symmetry groups, there are additional topics on circles and on crystallographic and frieze groups, and a final chapter on affine and Cartesian coordinates. The exercises are a mixture of routine problems, experiments, and proofs.

A First Course in Enumerative Combinatorics provides an introduction to the fundamentals of enumeration for advanced undergraduates and beginning graduate students in the mathematical sciences. The book offers a careful and comprehensive account of the standard tools of enumeration--recursion, generating functions, sieve and inversion formulas, enumeration under group actions--and their application to counting problems for the fundamental structures of discrete mathematics, including sets and multisets, words and permutations, partitions of sets and integers, and graphs and trees. The author's

An introduction, suitable for beginning graduate students, showing connections to other areas of mathematics.

This book provides an introduction to discrete mathematics. At the end of the book the reader should be able to answer counting questions such as: How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? The book can be used as a textbook for a semester course at the sophomore level. The first five chapters can also serve as a basis for a graduate course for in-service teachers.

A First Course in Stochastic Calculus is a complete guide for advanced undergraduate students to take the next step in exploring probability theory and for master's students in mathematical finance who would like to build an intuitive and theoretical understanding of stochastic processes. This book is also an essential tool for finance professionals who wish to sharpen their knowledge and intuition about stochastic calculus. Louis-Pierre Arguin offers an exceptionally clear introduction to Brownian motion and to random processes governed by the principles of stochastic calculus. The beauty and power of the subject are made accessible to readers with a basic knowledge of probability, linear algebra, and multivariable calculus. This is achieved by emphasizing numerical experiments using elementary Python coding to build intuition and adhering to a rigorous geometric point of view on the space of random variables. This unique approach is used to elucidate the properties of Gaussian processes, martingales, and diffusions. One of the book's highlights is a detailed and self-contained account of stochastic calculus applications to option pricing in finance. Louis-Pierre Arguin's masterly introduction to stochastic calculus seduces the reader with its quietly conversational style; even rigorous proofs seem natural and easy. Full of insights and intuition, reinforced with many examples, numerical projects, and exercises, this book by a prize-winning mathematician and great teacher fully lives up to the author's reputation. I give it my strongest possible recommendation. —Jim Gatheral, Baruch College I happen to be of a different persuasion, about how stochastic processes should be taught to undergraduate and MA students. But I have long been thinking to go against my own grain at some point and try to teach the subject at this level—together with its applications to finance—in one semester. Louis-Pierre Arguin's excellent and artfully designed text will give me the ideal vehicle to do so. —Ioannis Karatzas, Columbia University, New York

Praise for the First Edition “This excellent text should prove a useful accoutrement for any developing mathematics program . . . it’s short, it’s sweet, it’s beautifully written.” —The Mathematical Intelligencer “Erickson has prepared an exemplary work . . . strongly recommended for inclusion in undergraduate-level library collections.” —Choice Featuring a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin’s sequence, Rook paths, and Leech’s lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations. Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden’s theorem on arithmetic progressions, Pólya’s graph enumeration formula, and Leech’s 24-dimensional lattice. Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideas A deeper, investigative study of combinatorics through exercises requiring the use of computer programs Over fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial concepts Basic principles and theories in combinatorics as well as new and innovative results in the field Introduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics.

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers. The contributors survey the methods of combinatorial enumeration along with the most frequent applications of these methods.This important new work is edited by Miklos Bona of the University of Florida where he