Notes on Introductory Combinatorics

George Polya

ISBN 10: 0817631704 / ISBN 13: 9780817631703

Editore: Birkhäuser Boston, Birkhäuser Boston Jan 1990, 1990

Riguardo questo articolo

Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 204 pp. Englisch.

Codice articolo 9780817631703

Dati bibliografici

• Titolo: Notes on Introductory Combinatorics
• Editore: Birkhäuser Boston, Birkhäuser Boston Jan 1990
• Data di pubblicazione: 1990
• Lingua: Inglese
• ISBN 10: 0817631704
• ISBN 13: 9780817631703
• Rilegatura: Taschenbuch
• Condizione: Neu
• Dimensioni: 235 L x 155 A x 12 P (millimetri) 235 millimetri di larghezza per 155 millimetri di altezza per 12 millimetri di profondità
• Peso: 318 grammi

Descrizione articolo

Riassunto

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.

Contenuti

1. Introduction.- 2. Combinations and Permutations.- 3. Generating Functions.- 4. Principle of Inclusion and Exclusion.- 5. Stirling Numbers.- 6. Pólya’s Theory of Counting.- 7. Outlook.- 8. Midterm Examination.- 9. Ramsey Theory.- 10. Matchings (Stable Marriages).- 11. Matchings (Maximum Matchings).- 12. Network Flow.- 13. Hamiltonian and Eulerian Paths.- 14. Planarity and the Four-Color Theorem.- 15. Final Examination.- 16. Bibliography.