How to Count: An Introduction to Combinatorics and Its Applications

How to Count: An Introduction to Combinatorics and Its Applications

by Robert A. Beeler
How to Count: An Introduction to Combinatorics and Its Applications

How to Count: An Introduction to Combinatorics and Its Applications

by Robert A. Beeler

eBook2015 (2015)

$48.99  $64.99 Save 25% Current price is $48.99, Original price is $64.99. You Save 25%.

Available on Compatible NOOK devices, the free NOOK App and in My Digital Library.
WANT A NOOK?  Explore Now

Related collections and offers


Overview

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.

Product Details

ISBN-13: 9783319138442
Publisher: Springer-Verlag New York, LLC
Publication date: 03/14/2015
Sold by: Barnes & Noble
Format: eBook
File size: 8 MB

About the Author

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.

Table of Contents

Preliminaries.- Basic Counting.- The Binomial Coefficient.- Distribution Problems.- Generating Functions.- Recurrence Relations.- Advanced Counting - Inclusion and Exclusion.- Advanced Counting - Polya Theory.- Application: Probability.- Application: Combinatorial Designs.- Application: Graph Theory.- Appendices.

From the B&N Reads Blog

Customer Reviews