How to Count | An Introduction to Combinatorics and Its Applications

Robert A. Beeler

ISBN 10: 331913843X / ISBN 13: 9783319138435

Published by Springer Nature Switzerland, 2015

About this Item

How to Count | An Introduction to Combinatorics and Its Applications | Robert A. Beeler | Buch | xv | Englisch | 2015 | Springer Nature Switzerland | EAN 9783319138435 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Seller Inventory # 105018706

Bibliographic Details

• Title: How to Count | An Introduction to Combinatorics and Its Applications
• Publisher: Springer Nature Switzerland
• Publication Date: 2015
• Language: English
• ISBN 10: 331913843X
• ISBN 13: 9783319138435
• Binding: Buch
• Condition: Neu
• Dimensions: 241W x 160H x 25D millimeters 241 millimeters width by 160 millimeters height by 25 millimeters depth
• Weight: 734 grams
• Seller catalogs:
  • Bücher

About this title

Synopsis

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 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.