Notes on Introductory Combinatorics (Progress in Computer Science and Applied Logic, 4, Band 4) - Softcover

Polya, George

Softcover

ISBN 10: 0817631704 ISBN 13: 9780817631703

Verlag: Birkhäuser Boston, 1990

Inhaltsangabe

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.

Über diesen Titel

Über die Autorin bzw. den Autor

Biography of George Pólya Born in Budapest, December 13, 1887, George Pólya initially studied law, then languages and literature in Budapest. He came to mathematics in order to understand philosophy, but the subject of his doctorate in 1912 was in probability theory and he promptly abandoned philosophy. After a year in Göttingen and a short stay in Paris, he received an appointment at the ETH in Zürich. His research was multi-faceted, ranging from series, probability, number theory and combinatorics to astronomy and voting systems. Some of his deepest work was on entire functions. He also worked in conformal mappings, potential theory, boundary value problems, and isoperimetric problems in mathematical physics, as well as heuristics late in his career. When Pólya left Europe in 1940, he first went to Brown University, then two years later to Stanford, where he remained until his death on September 7, 1985. Biography of Gabor Szegö Born in Kunhegyes, Hungary, January 20, 1895, Szegö studied in Budapest and Vienna, where he received his Ph. D. in 1918, after serving in the Austro-Hungarian army in the First World War. He became a privatdozent at the University of Berlin and in 1926 succeeded Knopp at the University of K?nigsberg. It was during his time in Berlin that he and Pólya collaborated on their great joint work, the Problems and Theorems in Analysis. Szegö's own research concentrated on orthogonal polynomials and Toeplitz matrices. With the deteriorating situation in Germany at that time, he moved in 1934 to Washington University, St. Louis, where he remained until 1938, when he moved to Stanford. As department head at Stanford, he arranged for Pólya to join the Stanford faculty in 1942. Szegö remained at Stanford until his death on August 7, 1985.

Details zur Ausgabe

• Verlag: Birkhäuser Boston
• Erscheinungsdatum: 1990
• Sprache: Englisch
• ISBN 10: 0817631704
• ISBN 13: 9780817631703
• Einband: Taschenbuch
• Anzahl der Seiten: 204
• Kontakt zum Hersteller: ProductSafety@springernature.com; ProductSafety@springernature.com; ; Poststr. 9; Darmstadt; 64293; Deutschland