How to count: an introduction to combinatorics
"Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. This second edition incorporates 50 percent more material. It includes seven new cha…
Read More ↓Title Statements
- Full title :How to count : an introduction to combinatorics / R.B.J.T. Allenby, Alan Slomson.
Summary
"Completely revised, How to Count: An Introduction to Combinatorics, Second Edition shows how to solve numerous classic and other interesting combinatorial problems. The authors take an easily accessible approach that introduces problems before leading into the theory involved. Although the authors present most of the topics through concrete problems, they also emphasize the importance of proofs in mathematics. This second edition incorporates 50 percent more material. It includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. This edition also contains more than 450 exercises. Ideal for both classroom teaching and self-study, this text requires only a modest amount of mathematical background. In an engaging way, it covers many combinatorial tools, such as the inclusion-exclusion principle, generating functions, recurrence relations, and Pólya's counting theorem."--Publisher's description.
Read More ↓Edition Statements
- Publication Date:©2011.
- Edition:2nd ed
Publication Statements
- Publisher(s):CRC Press
- Place of Publication:Boca Raton, FL
- Language:eng
- Publication Date:©2011.
Notes
Originally published as: an introduction to combinatorics, 1991.
The Physical Object
- Description:xv, 430 pages : : illustrations ; : 27 cm
Edition Identifiers
- ISBN:9781420082609, 1420082604
- oclc:ocn642510225
- LC Classification:QA164
- Dewey Decimal:511/.6
Table of Contents
What's it all about? -- Permutations and combinations -- Occupancy problems -- The inclusion-exclusion principle -- Stirling and Catalan numbers -- Partitions and dot diagrams -- Generating functions and recurrence relations -- Partitions and generating functions -- Introduction to graphs -- Trees -- Groups of permutations -- Group actions -- Counting patterns -- Pólya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings.
Read More ↓Subjects
Writers
More from this Series
No reviews yet. Be the first to rate this work.
Related Works
more →
Combinatorial games
Combinatorial and geometric group theory
Combinatorics
Integer Programming and Combinatorial Optimization
Files & Downloads
-
How to Count: An Introduction to Combinatorics, S…
PDF · 3.1 MB · updated
Rate & Review