Notes on Introductory Combinatorics

3.88 avg rating
( 8 ratings by Goodreads )
 
9780817631703: Notes on Introductory Combinatorics
View all copies of this ISBN edition:
 
 

In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who ·was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations.

"synopsis" may belong to another edition of this title.

From the Back Cover:

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."

―Zentralblatt MATH (Review of the original hardcover edition)

Review:

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)

"About this title" may belong to another edition of this title.

List Price: US$ 89.99
US$ 107.77

Convert currency

Shipping: FREE
From United Kingdom to U.S.A.

Destination, rates & speeds

Add to Basket

Other Popular Editions of the Same Title

9780817649524: Notes on Introductory Combinatorics (Modern Birkhäuser Classics)

Featured Edition

ISBN 10:  0817649522 ISBN 13:  9780817649524
Publisher: Birkhäuser, 2009
Softcover

9780817631239: Notes on Introductory Combinatorics

Birkhä..., 1983
Hardcover

9783764331238: Notes on Introductory Combinatorics (Progress in Computer Science)

Birkha..., 1984
Hardcover

Top Search Results from the AbeBooks Marketplace

1.

Georg Polya, Robert Endre Tarjan, Donald R. Woods
Published by BIRKHAUSER BOSTON INC, United States (1990)
ISBN 10: 0817631704 ISBN 13: 9780817631703
New Paperback Quantity Available: 10
Seller:
Book Depository hard to find
(London, United Kingdom)

Book Description BIRKHAUSER BOSTON INC, United States, 1990. Paperback. Condition: New. 2nd Revised edition. Language: English. Brand new Book. In the winter of 1978, Professor George P61ya and I jointly taught Stanford University's introductory combinatorics course. This was a great opportunity for me, as I had known of Professor P61ya since having read his classic book, How to Solve It, as a teenager. Working with P6lya, who *was over ninety years old at the time, was every bit as rewarding as I had hoped it would be. His creativity, intelligence, warmth and generosity of spirit, and wonderful gift for teaching continue to be an inspiration to me. Combinatorics is one of the branches of mathematics that play a crucial role in computer sCience, since digital computers manipulate discrete, finite objects. Combinatorics impinges on computing in two ways. First, the properties of graphs and other combinatorial objects lead directly to algorithms for solving graph-theoretic problems, which have widespread application in non-numerical as well as in numerical computing. Second, combinatorial methods provide many analytical tools that can be used for determining the worst-case and expected performance of computer algorithms. A knowledge of combinatorics will serve the computer scientist well. Combinatorics can be classified into three types: enumerative, eXistential, and constructive. Enumerative combinatorics deals with the counting of combinatorial objects. Existential combinatorics studies the existence or nonexistence of combinatorial configurations. Seller Inventory # LIE9780817631703

More information about this seller | Contact this seller

Buy New
US$ 107.77
Convert currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, rates & speeds

2.

George Polya, Robert E. Tarjan, Donald R. Woods
Published by Birkhäuser Boston (1990)
ISBN 10: 0817631704 ISBN 13: 9780817631703
New Paperback Quantity Available: 1
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)

Book Description Birkhäuser Boston, 1990. Paperback. Condition: New. Seller Inventory # DADAX0817631704

More information about this seller | Contact this seller

Buy New
US$ 113.48
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds

3.

George Polya/ Robert E. Tarjan/ Donald R. Woods
Published by Birkhauser (1984)
ISBN 10: 0817631704 ISBN 13: 9780817631703
New Paperback Quantity Available: 1
Seller:
Revaluation Books
(Exeter, United Kingdom)

Book Description Birkhauser, 1984. Paperback. Condition: Brand New. 1st edition. 212 pages. 9.00x6.00x0.50 inches. In Stock. Seller Inventory # zk0817631704

More information about this seller | Contact this seller

Buy New
US$ 145.97
Convert currency

Add to Basket

Shipping: US$ 9.73
From United Kingdom to U.S.A.
Destination, rates & speeds

4.

George Polya
Published by Birkhäuser (1990)
ISBN 10: 0817631704 ISBN 13: 9780817631703
New Paperback Quantity Available: 1
Seller:
Books Express
(Portsmouth, NH, U.S.A.)

Book Description Birkhäuser, 1990. Paperback. Condition: New. Ships with Tracking Number! INTERNATIONAL WORLDWIDE Shipping available. Buy with confidence, excellent customer service!. Seller Inventory # 0817631704n

More information about this seller | Contact this seller

Buy New
US$ 326.02
Convert currency

Add to Basket

Shipping: FREE
Within U.S.A.
Destination, rates & speeds