Cantitate/Preț
Produs

Notes on Introductory Combinatorics: Modern Birkhäuser Classics

Autor George Pólya, Robert E. Tarjan, Donald R. Woods
en Limba Engleză Paperback – 17 noi 2009
"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text.
One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory…[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading." Mathematical Reviews (Review of the original hardcover edition)
"The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya." Zentralblatt MATH (Review of the original hardcover edition)
Citește tot Restrânge

Din seria Modern Birkhäuser Classics

Preț: 46880 lei

Nou

Puncte Express: 703

Preț estimativ în valută:
8973 9352$ 7469£

Carte tipărită la comandă

Livrare economică 06-20 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780817649524
ISBN-10: 0817649522
Pagini: 192
Ilustrații: XII, 192 p. 125 illus.
Dimensiuni: 155 x 235 x 11 mm
Greutate: 0.3 kg
Ediția:2010
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Modern Birkhäuser Classics

Locul publicării:Boston, MA, United States

Public țintă

Graduate

Cuprins

Introduction.- Combinations and Permutations.- Generating Functions.- Principle of Inclusion and Exclusion.- Stirling Numbers.- Pólya's Theory of Counting.- Outlook.- Midterm Examination.- Ramsey Theory.- Matchings (Stable Marriages).- Matchings (Maximum Matchings).- Network Flow.- Hamiltonian and Eulerian Paths.- Planarity and the Four-Color Theorem.- Final Examination.- Bibliography.

Recenzii

From the reviews:
“The purpose of this re-publication was to make modern classics books like this one remain accessible to new generations of students, scholars and researchers.” (Zentralblatt MATH, Vol. 1195, 2010)

Textul de pe ultima copertă

Developed from the authors’ introductory combinatorics course, this book focuses on a branch of mathematics which plays a crucial role in computer science. Combinatorial methods provide many analytical tools used for determining the expected performance of computer algorithms. Elementary subjects such as combinations and permutations, and mathematical tools such as generating functions and Pólya’s Theory of Counting, are covered, as are analyses of specific problems such as Ramsey Theory, matchings, and Hamiltonian and Eulerian paths.
 
This introduction will provide students with a solid foundation in the subject.
 
----
 
"This is a delightful little paperback which presents a day-by-day transcription of a course taught jointly by Pólya and Tarjan at Stanford University. Woods, the teaching assistant for the class, did a very good job of merging class notes into an interesting mini-textbook; he also included the exercises, homework, and tests assigned in the class (a very helpful addition for other instructors in the field). The notes are very well illustrated throughout and Woods and the Birkhäuser publishers produced a very pleasant text.
 
One can count on [Pólya and Tarjan] for new insights and a fresh outlook. Both instructors taught by presenting a succession of examples rather than by presenting a body of theory…[The book] is very well suited as supplementary material for any introductory class on combinatorics; as such, it is very highly recommended. Finally, for all of us who like the topic and delight in observing skilled professionals at work, this book is entertaining and, yes, instructive, reading."
—Mathematical Reviews (Review of the original hardcover edition)
 
"The mathematical community welcomes this book as a final contribution to honour the teacher G. Pólya."
—ZentralblattMATH (Review of the original hardcover edition)

Caracteristici

An affordable new softcover edition of a classic text Comprehensive introductory overview of combinatorics Homework exercises and examinations included, making the book useful in courses Results serve as a basis for applications in computer science Includes supplementary material: sn.pub/extras