George Pólya

George Pólya (/ˈpoʊljə/; Hungarian: Pólya György [ˈpoːjɒ ˈɟørɟ]) (December 13, 1887 – September 7th, 1985) was a Hungarian mathematician. He was a professor of mathematics from 1914 to 1940 at ETH Zürich and from 1940 to 1953 at Stanford University. He made fundamental contributions to combinatorics, number theory, numerical analysis and probability theory. He is also noted for his work in heuristics and mathematics education.[3] He has been described as one of The Martians.[4]

George Pólya
George Pólya, circa 1973
Born(1887-12-13)December 13, 1887
Budapest, Hungary
DiedSeptember 7, 1985(1985-09-07) (aged 97)
Palo Alto
NationalityHungarian
Swiss (1918–1947)
American (since 1947)[1]
Alma materEötvös Loránd University
Known forPólya–Szegő inequality
How to Solve It
Multivariate Pólya distribution
Pólya conjecture
Pólya enumeration theorem
Landau–Kolmogorov inequality
Pólya–Vinogradov inequality
Pólya inequality
Pólya–Aeppli distribution
Pólya urn model
Fueter–Pólya theorem
Hilbert–Pólya conjecture
Scientific career
FieldsMathematics
InstitutionsETH Zürich
Stanford University
Doctoral advisorLipót Fejér
Doctoral studentsAlbert Edrei
Hans Einstein
Fritz Gassmann
Albert Pfluger
James J. Stoker
Alice Roth
InfluencesE.T. Jaynes[2]
InfluencedImre Lakatos

Life and works

Pólya was born in Budapest, Austria-Hungary to Anna Deutsch and Jakab Pólya, Hungarian Jews who had converted to the Roman Catholic faith in 1886.[5] Although his parents were religious and he was baptized into the Roman Catholic Church, George Pólya grew up to be an agnostic.[6] He was a professor of mathematics from 1914 to 1940 at ETH Zürich in Switzerland and from 1940 to 1953 at Stanford University. He remained Stanford Professor Emeritus for the rest of his life and career. He worked on a range of mathematical topics, including series, number theory, mathematical analysis, geometry, algebra, combinatorics, and probability.[7] He was an Invited Speaker of the ICM in 1928 at Bologna,[8] in 1936 at Oslo, and in 1950 at Cambridge, Massachusetts.

He died in Palo Alto, California, United States.

Heuristics

Early in his career, Pólya wrote with Gábor Szegő two influential problem books Problems and Theorems in Analysis (I: Series, Integral Calculus, Theory of Functions and II: Theory of Functions. Zeros. Polynomials. Determinants. Number Theory. Geometry). Later in his career, he spent considerable effort to identify systematic methods of problem-solving to further discovery and invention in mathematics for students, teachers, and researchers.[9] He wrote five books on the subject: How to Solve It, Mathematics and Plausible Reasoning (Volume I: Induction and Analogy in Mathematics, and Volume II: Patterns of Plausible Inference), and Mathematical Discovery: On Understanding, Learning, and Teaching Problem Solving (volumes 1 and 2).

In How to Solve It, Pólya provides general heuristics for solving a gamut of problems, including both mathematical and non-mathematical problems. The book includes advice for teaching students of mathematics and a mini-encyclopedia of heuristic terms. It was translated into several languages and has sold over a million copies. Russian physicist Zhores I. Alfyorov (Nobel laureate in 2000) praised it, noting that he was a fan. The Australian-American mathematician Terence Tao used the book to prepare for the International Mathematical Olympiad. The book is still used in mathematical education. Douglas Lenat's Automated Mathematician and Eurisko artificial intelligence programs were inspired by Pólya's work.

In addition to his works directly addressing problem solving, Pólya wrote another short book called Mathematical Methods in Science, based on a 1963 work supported by the National Science Foundation, edited by Leon Bowden, and published by the Mathematical Association of America (MAA) in 1977. As Pólya notes in the preface, Bowden carefully followed a tape recording of a course Pólya gave several times at Stanford in order to put the book together. Pólya notes in the preface "that the following pages will be useful, yet they should not be regarded as a finished expression."

Legacy

There are three prizes named after Pólya, causing occasional confusion of one for another. In 1969 the Society for Industrial and Applied Mathematics (SIAM) established the George Pólya Prize, given alternately in two categories for "a notable application of combinatorial theory" and for "a notable contribution in another area of interest to George Pólya."[10] In 1976 the Mathematical Association of America (MAA) established the George Pólya Award "for articles of expository excellence" published in the College Mathematics Journal.[11] In 1987 the London Mathematical Society (LMS) established the Pólya Prize for "outstanding creativity in, imaginative exposition of, or distinguished contribution to, mathematics within the United Kingdom."[12]

A mathematics center has been named in Pólya's honor at the University of Idaho in Moscow, Idaho. The mathematics center focuses mainly on tutoring students in the subjects of algebra and calculus.[13]

Stanford University has a Polya Hall named in his honor.[14] It was built while he was still teaching and he complained to his students that it made people think he was dead.

Selected publications

Books
  • Aufgaben und Lehrsätze aus der Analysis, 1st edn. 1925.[15] ("Problems and theorems in analysis“). Springer, Berlin 1975 (with Gábor Szegő).
  1. Reihen. 1975, 4th edn., ISBN 3-540-04874-X.
  2. Funktionentheorie, Nullstellen, Polynome, Determinanten, Zahlentheorie. 1975, 4th edn., ISBN 3-540-05456-1.
  • Mathematik und plausibles Schliessen. Birkhäuser, Basel 1988,
  1. Induktion und Analogie in der Mathematik, 3rd edn., ISBN 3-7643-1986-0 (Wissenschaft und Kultur; 14).
  2. Typen und Strukturen plausibler Folgerung, 2nd edn., ISBN 3-7643-0715-3 (Wissenschaft und Kultur; 15).
  • – English translation: Mathematics and Plausible Reasoning, Princeton University Press 1954, 2 volumes (Vol. 1: Induction and Analogy in Mathematics, Vol. 2: Patterns of Plausible Inference)
  • Schule des Denkens. Vom Lösen mathematischer Probleme ("How to solve it“). 4th edn. Francke Verlag, Tübingen 1995, ISBN 3-7720-0608-6 (Sammlung Dalp).
  • – English translation: How to Solve It, Princeton University Press 2004 (with foreword by John Horton Conway and added exercises)
  • Vom Lösen mathematischer Aufgaben. 2nd edn. Birkhäuser, Basel 1983, ISBN 3-7643-0298-4 (Wissenschaft und Kultur; 21).
  • – English translation: Mathematical Discovery: On Understanding, Learning and Teaching Problem Solving, 2 volumes, Wiley 1962 (published in one vol. 1981)
  • Collected Papers, 4 volumes, MIT Press 1974 (ed. Ralph P. Boas). Vol. 1: Singularities of Analytic Functions, Vol. 2: Location of Zeros, Vol. 3: Analysis, Vol. 4: Probability, Combinatorics
  • with R. C. Read: Combinatorial enumeration of groups, graphs, and chemical compounds, Springer Verlag 1987 (English translation of Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen, Acta Mathematica, vol. 68, 1937, pp. 145–254)
  • with Godfrey Harold Hardy: John Edensor Littlewood Inequalities, Cambridge University Press 1934
  • Mathematical methods in Science, MAA, Washington D. C. 1977 (ed. Leon Bowden)
  • with Gordon Latta: Complex Variables, Wiley 1974
  • with Robert E. Tarjan, Donald R. Woods: Notes on introductory combinatorics, Birkhäuser 1983
  • with Jeremy Kilpatrick: The Stanford mathematics problem book: with hints and solutions, New York: Teachers College Press 1974
  • with several co-authors: Applied combinatorical mathematics, Wiley 1964 (ed. Edwin F. Beckenbach)
  • with Gábor Szegő: Isoperimetric inequalities in mathematical physics, Princeton, Annals of Mathematical Studies 27, 1951

Articles
gollark: A noble goal. Hold on.
gollark: it not badit B**E***S*`T`.
gollark: I have a bunch of games which don't run on PotatOS for x86 yet.
gollark: It might be easier to write my own kernel, but I want to benefit from existing software.
gollark: It's easy as long as you have 64 cores to compile on and knowledge of C, all C libraries, and all the code of software you run!

See also

References
  1. George Polya in the Swiss historic lexicon.
  2. Jaynes, E. T. (2003). Probability theory: The logic of science. Cambridge university press. p. 6
  3. Alexanderson, Gerald L. (2000). The random walks of George Pólya. Washington, DC: Mathematical Association of America.
  4. A marslakók legendája – György Marx
  5. "Archived copy". Archived from the original on 2012-03-02. Retrieved 2009-07-04.CS1 maint: archived copy as title (link)
  6. Harold D. Taylor, Loretta Taylor (1993). George Pólya: master of discovery 1887–1985. Dale Seymour Publications. p. 50. ISBN 978-0-86651-611-2. Plancherel was a military man, a colonel in the Swiss army, and a devout Catholic; Pólya did not like military ceremonies or activities, and he was an agnostic who objected to hierarchical religions.
  7. Roberts, A. Wayne (1995). Faces of Mathematics, Third Edition. New York, NY USA: HarperCollins College Publishers. p. 479. ISBN 0-06-501069-8.
  8. Pólya, G. "Ueber eine Eigenschaft des Gaussschen Fehlergesetzes". In: Atti del Congresso Internazionale dei Matematici: Bologna del 3 al 10 de settembre di 1928. vol. 6. pp. 63–64.
  9. Schoenfeld, Alan H. (December 1987). "Pólya, Problem Solving, and Education". Mathematics Magazine. Mathematics Magazine, Vol. 60, No. 5. 60 (5): 283–291. doi:10.2307/2690409. JSTOR 2690409.
  10. Society for Industrial and Applied Mathematics George Pólya Prize
  11. Mathematical Association of America George Pólya Award
  12. "London Mathematical Society Polya Prize". Archived from the original on 2010-05-10. Retrieved 2009-10-09.
  13. "University of Idaho Polya Center". Archived from the original on 2012-01-21. Retrieved 2011-09-24.
  14. "POLYA HALL, 14-160". Retrieved 2020-04-03.
  15. Tamarkin, J. D. (1928). "Review: Aufgaben und Lehrsätze aus der Analysis, vols. 1 & 2, by George Pólya and Gábor Szegő" (PDF). Bull. Amer. Math. Soc. 34 (2): 233–234. doi:10.1090/s0002-9904-1928-04522-6.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.