- Gebundene Ausgabe: 252 Seiten
- Verlag: Springer; Auflage: 2001 (1. Juli 2001)
- Sprache: Englisch
- ISBN-10: 038795225X
- ISBN-13: 978-0387952253
- Größe und/oder Gewicht: 15,6 x 1,8 x 23,4 cm
- Durchschnittliche Kundenbewertung: Schreiben Sie die erste Bewertung
Nr. 678.796 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
- Nr. 203 in Fremdsprachige Bücher > Wissenschaft > Mathematik > Reine Mathematik > Kombinatorik
- Nr. 213 in Fremdsprachige Bücher > Wissenschaft > Mathematik > Reine Mathematik > Diskrete Mathematik
- Nr. 2500 in Fremdsprachige Bücher > Wissenschaft > Mathematik > Angewandte Mathematik > Wahrscheinlichkeit & Statistik
- Komplettes Inhaltsverzeichnis ansehen
Counting: The Art of Enumerative Combinatorics (Undergraduate Texts in Mathematics) (Englisch) Gebundene Ausgabe – 1. Juli 2001
Kunden, die diesen Artikel gekauft haben, kauften auch
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
From the reviews:
"Much of Martin’s charming and accessible text could be used with bright school students. … The book is rounded off by a section called ‘The back of the book’ which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended." (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004)
"This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! … If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book." (W. Moser, Mathematical Reviews, Issue 2002 g)
"This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas … . A lot of ‘easy’ applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems." (Péter L. Erdös, Zentralblatt MATH, Vol. 968, 2001)
"The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. … The author uses non-worked discovery-type examples to lead into observations about the material. … There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a ‘Back of the Book’ section rather than an Answers section." (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)
Counting is hard. "Counting" is short for "Enumerative Combinatorics," which certainly doesn't sound easy. This book provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to...At the end of the book the reader should be able to answer such nontrivial counting questions as, How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip? There are no prerequisites for this course beyond mathematical maturity. The book can be used for a semester course at the sophomore level as introduction to discrete mathematics for mathematics, computer science, and statistics students. The first five chapters can also serve as a basis for a graduate course for in-service teachers.Alle Produktbeschreibungen
Die hilfreichsten Kundenrezensionen auf Amazon.com (beta) (Kann Kundenrezensionen aus dem "Early Reviewer Rewards"-Programm beinhalten)
From the point of view of someone interested in computer science, all the key stuff is covered: perms/combs, pigeonhole, inclusion/exclusion, Stirling, Bell, Catalan, Fibonacci, recurrences, generating functions, induction, etc. There are lots of worked out examples and plenty of excellent, instructive problems with useful hints and solutions in the "back of the book" section (which comprises over 60 pages).
As the author explains in the preface, chapters 1-3 plus 6 (recurrences) form a good CS course, to which I would add chapter 7 on induction. The final chapter on graph theory is necessarily incomplete, but still worth reading.
Chapters 4 and 5 discuss symmetry groups and Polya theory, and are treated equally well for those who wish to delve into these subjects.
Top notch stuff.
It covers simple counting, groups, generating functions, recurrence relations and mathematical induction. The book concludes with graph theory. Some chapter sections get a little hard to understand, hence the 4 star and not 5 star rating (2 stars is what I'd give a decent book, so this one is a shining star). Most of the book is clear cut.
Ähnliche Artikel finden
- Fremdsprachige Bücher > Computer & Internet
- Fremdsprachige Bücher > Wissenschaft > Mathematik > Angewandte Mathematik > Wahrscheinlichkeit & Statistik
- Fremdsprachige Bücher > Wissenschaft > Mathematik > Reine Mathematik > Diskrete Mathematik
- Fremdsprachige Bücher > Wissenschaft > Mathematik > Reine Mathematik > Kombinatorik