Pál Turán
Pál Turán | |
---|---|
Born | Budapest, Hungary |
18 August 1910
Died | 26 September 1976 Budapest, Hungary |
(aged 66)
Residence | Hungary |
Nationality | Hungarian |
Alma mater | University of Budapest |
Known for | Power sum method Extremal graph theory |
Awards | Kossuth Prize Tibor Szele Prize |
Scientific career | |
Fields | Mathematics |
Institutions | University of Budapest |
Doctoral advisor | Lipót Fejér |
Doctoral students | László Babai János Pintz |
Pál Turán (Hungarian: [ˈpaːl ˈturaːn]; 18 August 1910 – 26 September 1976)^{[1]}^{:271}^{[2]} also known as Paul Turán, was a Hungarian mathematician who worked primarily in number theory. He had a long collaboration with fellow Hungarian mathematician Paul Erdős, lasting 46 years and resulting in 28 joint papers.^{[3]}
Contents
Life and education[edit]
Turán was born into a Jewish family in Budapest on 18 August 1910.^{[1]}^{:271}At the same period of time, Turán and Erdős were famous answerers in the journal KöMaL. He received a teaching degree at the University of Budapest in 1933 and the Ph.D. degree under Lipót Fejér in 1935 at Eötvös Loránd University.^{[1]}^{:271} As a Jew, he fell victim to numerus clausus, and could not get a university job for several years.^{[4]} He was sent to labour service at various times from 1940 to 1944. He is said to have been recognized and perhaps protected by a fascist guard, who, as a mathematics student, had admired Turán's work.^{[5]}
He became associate professor at the University of Budapest in 1945 and full professor in 1949.^{[1]}^{:272} First he married Edit (Klein) Kóbor in 1939 and had a son Róbert then he married mathematician Vera Sós in 1952 and they had two children György and Tamás.^{[6]}^{:20}
He died in Budapest on 26 September 1976^{[1]}^{:271} of leukemia.^{[7]}^{:8}
Work[edit]
Turán worked primarily in number theory,^{[7]}^{:4} but also did much work in analysis and graph theory.
Number theory[edit]
In 1934 Turán used the Turán sieve to give a new and very simple proof of a 1917 result of G. H. Hardy and Ramanujan on the normal order of the number of distinct prime divisors of a number n, namely that it is very close to ln ln n. In probabilistic terms he estimated the variance from ln ln n. Halász says "Its true significance lies in the fact that it was the starting point of probabilistic number theory". ^{[8]}^{:16} The Turán–Kubilius inequality is a generalization of this work.^{[7]}^{:5} ^{[8]}^{:16}
Turán was very interested in the distribution of primes in arithmetic progressions, and he coined the term "prime number race" for irregularities in the distribution of prime numbers among residue classes.^{[7]}^{:5} With his coauthor Knapowski he proved results concerning Chebyshev's bias.
The Erdős–Turán conjecture makes a statement about primes in arithmetic progression.
Much of Turán's number theory work dealt with the Riemann hypothesis and he developed the power sum method (see below) to help with this. Erdős said "Turán was an 'unbeliever,' in fact, a 'pagan': he did not believe in the truth of Riemann's hypothesis."^{[3]}^{:3}
Analysis[edit]
Much of Turán's work in analysis was tied to his number theory work. Outside of this he proved Turán's inequalities relating the values of the Legendre polynomials for different indices, and, together with Paul Erdős, the Erdős–Turán equidistribution inequality.
Graph theory[edit]
Erdős wrote of Turán, "In 1940–1941 he created the area of extremal problems in graph theory which is now one of the fastest-growing subjects in combinatorics."^{[3]}^{:4}Peter Frankl said about Turán."He fell victim to Numerus clausus. Mathematicians have only paper and pen, he doesn't have anything in camp. So he created combinatorics which is not needed both thing."^{[9]} The field is known more briefly today as extremal graph theory. Turán's best-known result in this area is Turán's Graph Theorem, that gives an upper bound on the number of edges in a graph that does not contain the complete graph K_{r} as a subgraph. He invented the Turán graph, a generalization of the complete bipartite graph, to prove his theorem. He is also known for the Kővári–Sós–Turán theorem bounding the number of edges that can exist in a bipartite graph with certain forbidden subgraphs, and for raising Turán's brick factory problem, namely of determining the crossing number of a complete bipartite graph.
Power sum method[edit]
Turán developed the power sum method to work on the Riemann hypothesis.^{[8]}^{:9–14} The method deals with inequalities giving lower bounds for sums of the form
hence the name "power sum".^{[10]}^{:319} Besides its applications in analytic number theory, it has been used in complex analysis, numerical analysis, differential equations, transcendental number theory, and estimating the number of zeroes of a function in a disk.^{[10]}^{:320}
Publications[edit]
- Ed. by P. Turán. (1970). Number Theory. Amsterdam: North-Holland Pub. Co. ISBN 978-0-7204-2037-1.
- Paul Turán (1984). On a New Method of Analysis and Its Applications. New York: Wiley-Interscience. ISBN 978-0-471-89255-7. Deals with the power sum method.
- edited by Paul Erdős. (1990). Collected Papers of Paul Turán. Budapest: Akadémiai Kiadó. ISBN 978-963-05-4298-2.
Honors[edit]
- Hungarian Academy of Sciences elected corresponding member in 1948 and ordinary member in 1953^{[1]}^{:272}
- Kossuth Prize in 1948 and 1952^{[1]}^{:272}
- Tibor Szele Prize of János Bolyai Mathematical Society 1975^{[1]}^{:272}
Notes[edit]
- ^ ^{a} ^{b} ^{c} ^{d} ^{e} ^{f} ^{g} ^{h} Alpár, L. (August 1981). "In memory of Paul Turán". Journal of Number Theory. Academic Press. 13 (3): 271–278. doi:10.1016/0022-314X(81)90012-3.
- ^ "Magyar Életrajzi Lexikon: Turán Pál" (in Hungarian). Magyar Elecktronikus Könyvtár (Hungarian Electronic Library). Retrieved 2008-06-21.
- ^ ^{a} ^{b} ^{c} Erdős, Paul (1980). "Some notes on Turán's mathematical work" (PDF). Journal of Approximation Theory. 29 (1): 2–6. doi:10.1016/0021-9045(80)90133-1. Retrieved 2008-06-22.
- ^ O'Connor, John J.; Robertson, Edmund F., "Paul Turán", MacTutor History of Mathematics archive, University of St Andrews.
- ^ "An officer was standing nearby, watching us work. When he heard my name, he asked the comrade whether I was a mathematician. It turned out, that the officer, Joshef Winkler, was an engineer. In his youth, he had placed in a mathematical competition; in civilian life he was a proof-reader at the print shop where the periodical of the Third Class of the Academy (Mathematical and Natural sciences) was printed. There he had seen some of my manuscripts." P. Turán, "A note of welcome", Journal of Graph Theory 1 (1977), pp. 7-9.
- ^ Babai, László (2001). "In and Out of Hungary: Paul Erdős, His Friends, and Times" (PostScript). University of Chicago. Retrieved 2008-06-22.
- ^ ^{a} ^{b} ^{c} ^{d} Erdős, Paul (1980). "Some personal reminiscences of the mathematical work of Paul Turán" (PDF). Acta Arithmetica. 37: 3–8. ISSN 0065-1036. Retrieved 2008-06-22.
- ^ ^{a} ^{b} ^{c} Halász, G. (1980). "The number-theoretic work of Paul Turán". Acta Arithmetica. 37: 9–19. ISSN 0065-1036. Archived from the original on September 28, 2006. Retrieved 2008-06-22.
- ^ http://www.imojp.org/column/index.htm peter's speech
- ^ ^{a} ^{b} Tijdeman, R. (April 1986). "Book reviews: On a new method of analysis and its applications" (PDF). Bulletin of the American Mathematical Society. Providence, RI: American Mathematical Society. 14 (2): 318–322. doi:10.1090/S0273-0979-1986-15456-X. Retrieved 2008-06-22.