R. B. J. T. Allenby, Alan Slomson

How to Count (eBook, PDF)

An Introduction to Combinatorics, Second Edition

• Format: PDF

Produktbeschreibung

Completely revised, this text 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. They present proofs of key results as well as numerous worked examples. This second edition includes seven new chapters that cover occupancy problems, Stirling and Catalan numbers, graph theory, trees, Dirichlet's pigeonhole principle, Ramsey theory, and rook polynomials. It also contains 450 paired exercises, along with a full solution to one of the exercises in each pair. A solutions manual is available upong qualifying course adoption.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Taylor & Francis
• Seitenzahl: 444
• Erscheinungstermin: 12. August 2010
• Englisch
• ISBN-13: 9781439895153
• Artikelnr.: 57150386

Autorenporträt

Alan Slomson taught mathematics at the University of Leeds from 1967 to 2008. He is currently the secretary of the United Kingdom Mathematics Trust.

R.B.J.T. Allenby taught mathematics at the University of Leeds from 1965 to 2007.

Inhaltsangabe

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.
Solutions to the A Exercises. Books for Further Reading. Index.