Inhaltsverzeichnis
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.
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)
Es wurden noch keine Bewertungen abgegeben. Schreiben Sie die erste Bewertung zu "How to Count" und helfen Sie damit anderen bei der Kaufentscheidung.