World Library  
Flag as Inappropriate
Email this Article
 

Pál Turán

Paul (Pál) Turán
Born (1910-08-18)18 August 1910
Budapest, Hungary
Died 26 September 1976 ( 1976 -09-26) (aged 66)
Budapest, Hungary
Residence Hungary
Nationality Hungarian
Fields Mathematics
Institutions University of Budapest
Alma mater University of Budapest
Doctoral advisor Lipót Fejér
Doctoral students László Babai
János Pintz
Known for Power sum method
Extremal graph theory
Notable awards Kossuth Prize
Tibor Szele Prize

Paul (Pál) Turán (Hungarian: ; 18 August 1910 – 26 September 1976)[1]:271[2] 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 1
  • Work 2
    • Number theory 2.1
    • Analysis 2.2
    • Graph theory 2.3
    • Power sum method 2.4
  • Publications 3
  • Honors 4
  • Notes 5
  • External links 6

Life and education

Turán was born into a Jewish family in Budapest on 18 August 1910.[1]:271 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 Robert 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

Turán worked primarily in number theory,[7]:4 but also did much work in analysis and graph theory.

Number theory

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

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

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 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 Kr 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

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

\max_{\nu=m+1,\dots,m+n} \left | \sum_{j=1}^n b_j z_j^\nu \right |,

hence the name "power sum".[9]: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.[9]:320

Publications

  • Ed. by P. Turán. (1970). Number Theory. Amsterdam: North-Holland Pub. Co.  
  • Paul Turán (1984). On a New Method of Analysis and Its Applications. New York: Wiley-Interscience. Deals with the power sum method.  
  • edited by Paul Erdős. (1990). Collected Papers of Paul Turán. Budapest: Akadémiai Kiadó.  

Honors

Notes

  1. ^ 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.  
  2. ^ "Magyar Életrajzi Lexikon: Turán Pál" (in Hungarian). Magyar Elecktronikus Könyvtár (Hungarian Electronic Library). Retrieved 2008-06-21. 
  3. ^ a b c  
  4. ^  .
  5. ^ "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.
  6. ^  
  7. ^ a b c d  
  8. ^ a b c Halász, G. (1980). "The number-theoretic work of Paul Turán". Acta Arithmetica 37: 9–19.  
  9. ^ a b  

External links

This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.