How to Count
An Introduction to Combinatorics and Its Applications
Authors: Beeler, Robert A.
Free Preview- A problem-based approach to learning Combinatorics
- Very computational in its orientation, with an added emphasis on Proof technique
- Written from the perspective of the student, with an abundance of exercises at the end of each section
- All computer simulations prepared in open-source SAGE software
Buy this book
- About this Textbook
-
Providing a self-contained resource for upper undergraduate courses in combinatorics, this text emphasizes computation, problem solving, and proof technique. In particular, the book places special emphasis the Principle of Inclusion and Exclusion and the Multiplication Principle. To this end, exercise sets are included at the end of every section, ranging from simple computations (evaluate a formula for a given set of values) to more advanced proofs. The exercises are designed to test students' understanding of new material, while reinforcing a working mastery of the key concepts previously developed in the book. Intuitive descriptions for many abstract techniques are included. Students often struggle with certain topics, such as generating functions, and this intuitive approach to the problem is helpful in their understanding. When possible, the book introduces concepts using combinatorial methods (as opposed to induction or algebra) to prove identities. Students are also asked to prove identities using combinatorial methods as part of their exercises. These methods have several advantages over induction or algebra.
- About the authors
-
Robert A. Beeler is an Associate Professor of Mathematics at East Tennessee State University. His research interests include enumerative combinatorics and graph theory; edge decompositions of graphs, graceful labelings on graphs, intersection/representation theory, and combinatorial designs; combinatorial games and games on graphs. He is a member of the Mathematics Association of America, the American Mathematical Society, and the Institute of Combinatorics and its Applications.
- Reviews
-
“The book is an excellent introduction to combinatorics. … The author uses a clear language and often provides an easy intuitive access to abstract subjects. The presentation is well motivated, the explanations are transparent and illustrated by carefully selected examples. Each section ends with a list of well formulated exercises which make the book ideally suited for self-instruction.” (Astrid Reifegerste, zbMATH 1328.05001, 2016)
“This book by Beeler … is an excellent introductory text on combinatorics. The author gives the right balance of theory, computation, and applications, and he presents introductory-level topics, such as the multiplication principle, binomial theorem, and distribution problems in a clear manner. … Summing Up: Highly recommended. Upper-division undergraduates through researchers and faculty.” (S. L. Sullivan, Choice, Vol. 53 (1), September, 2015)
- Table of contents (11 chapters)
-
-
Preliminaries
Pages 1-20
-
Basic Counting
Pages 21-57
-
The Binomial Coefficient
Pages 59-94
-
Distribution Problems
Pages 95-114
-
Generating Functions
Pages 115-146
-
Table of contents (11 chapters)
- Download Preface 1 PDF (256.2 KB)
- Download Sample pages 1 PDF (380.7 KB)
- Download Table of contents PDF (264.6 KB)
Buy this book
Services for this Book
Recommended for you
Bibliographic Information
- Bibliographic Information
-
- Book Title
- How to Count
- Book Subtitle
- An Introduction to Combinatorics and Its Applications
- Authors
-
- Robert A. Beeler
- Copyright
- 2015
- Publisher
- Springer International Publishing
- Copyright Holder
- Springer International Publishing Switzerland
- eBook ISBN
- 978-3-319-13844-2
- DOI
- 10.1007/978-3-319-13844-2
- Hardcover ISBN
- 978-3-319-13843-5
- Softcover ISBN
- 978-3-319-35508-5
- Edition Number
- 1
- Number of Pages
- XV, 361
- Number of Illustrations
- 59 b/w illustrations, 2 illustrations in colour
- Topics
