| Pál Turán | |
| Birth Date: | 18 August 1910 |
| Birth Place: | Budapest, Austria-Hungary |
| Death Place: | Budapest, Hungary |
| Nationality: | Hungarian |
| Fields: | Mathematics |
| Workplaces: | Eötvös Loránd University |
| Alma Mater: | Eötvös Loránd University |
| Doctoral Advisor: | Lipót Fejér |
| Doctoral Students: | László Babai János Pintz Peter Szüsz |
| Known For: | Extremal graph theory Turán graph Turán number Turán sieve Turán's inequalities Turán's lemma Turán's method Turán's theorem Turán–Kubilius inequality Erdős–Turán conjecture Erdős–Turán inequality Erdős–Turán construction Erdős–Turán–Koksma inequality Kővári–Sós–Turán theorem |
| Awards: | ICM Speaker (1970) Kossuth Prize (1948, 1952) |
Pál Turán (in Hungarian ˈpaːl ˈturaːn/; 18 August 1910 – 26 September 1976) also known as Paul Turán, was a Hungarian mathematician who worked primarily in extremal combinatorics.
In 1940, because of his Jewish origins, he was arrested by the Nazis and sent to a labour camp in Transylvania, later being transferred several times to other camps. While imprisoned, Turán came up with some of his best theories, which he was able to publish after the war.
Turán had a long collaboration with fellow Hungarian mathematician Paul Erdős, lasting 46 years and resulting in 28 joint papers.
Turán was born into a Hungarian Jewish family in Budapest on 18 August 1910. Pál's outstanding mathematical abilities showed early, already in secondary school he was the best student.[1]
At the same period of time, Turán and Pál Erdős were famous answerers in the journal KöMaL. On 1 September 1930, at a mathematical seminar at the University of Budapest, Turan met Erdős. They would collaborate for 46 years and produce 28 scientific papers together.
Turán received a teaching degree at the University of Budapest in 1933. In the same year he published two major scientific papers in the journals of the American and London Mathematical Societies.[2] He got the PhD degree under Lipót Fejér in 1935 at Eötvös Loránd University.
As a Jew, he fell victim to numerus clausus, and could not get a stable job for several years. He made a living as a tutor, preparing applicants and students for exams. It was not until 1938 that he got a job at a rabbinical training school in Budapest as a teacher's assistant, by which time he had already had 16 major scientific publications and an international reputation as one of Hungary's leading mathematicians.[2]
He married Edit (Klein) Kóbor in 1939; they had one son, Róbert.[3]
In September 1940 Turán was interned in labour service. As he recalled later, his five years in labour camps eventually saved his life: they saved him from ending up in a concentration camp, where 550,000 of the 770,000 Hungarian Jews were murdered during World War II. In 1940 Turán ended up in Transylvania for railway construction. Turán said that one day while working another prisoner addressed him by his surname, saying that he was working extremely clumsily:
"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."
Winkler wanted to help Turán and managed to get him transferred to an easier job. Turán was sent to the sawmill's warehouse, where he had to show the carriers the right-sized timbers. During this period, Turán composed and was partly able to record a long paper on the Riemann zeta function.[4]
Turán was subsequently transferred several times to other camps. As he later recalled, the only way he was able to keep his sanity was through mathematics, solving problems in his head and thinking through problems.[2]
In July 1944 Turán worked on a brick factory near Budapest. His and the other prisoners' task was to carry the brick cars from the kilns to the warehouses on rails that crossed at several points with other tracks. At these crossings the trolleys would "bounce" and some of the bricks would fall out, causing a lot of problems for the workers. This situation led Turan to consider how to achieve the minimum number of crossings for m kilns and n warehouses. It was only after the war, in 1952, that he was able to work seriously on this problem.
Turán was liberated in 1944, after which he was able to return to work at the rabbinical school in Budapest.[2]
Turán became associate professor at the University of Budapest in 1945 and full professor in 1949. In the early post-war years, the streets were patrolled by soldiers. On occasion, random people were seized and sent to penal camps in Siberia. Once such a patrol stopped Turan, who was on his way home from university. The soldiers questioned the mathematician and then forced him to show them the contents of his briefcase. Seeing a reprint of an article from a pre-War Soviet magazine among the papers, the soldiers immediately let the mathematician go. The only thing Turán said about that day in his correspondence with Erdös was that he had "come across an extremely interesting way of applying number theory..."[5]
In 1952 he married again, the second marriage was to Vera Sós, a mathematician. They had a son, György, in 1953. The couple published several papers together.[3]
One of his students said Turán was a very passionate and active man - in the summer he held maths seminars by the pool in between his swimming and rowing training. In 1960 he celebrated his 50th birthday and the birth of his third son, Tamás, by swimming across the Danube.
Turán was a member of the editorial boards of leading mathematical journals, he worked as a visiting professor at many of the top universities in the world. He was a member of the Polish, American and Austrian Mathematical Societies. In 1970, he was invited to serve on the committee of the Fields Prize. Turán also founded and served as the president of the János Bolyai Mathematical Society.
Around 1970 Turán was diagnosed with leukaemia, but the diagnosis was revealed only to his wife Vera Sós, who decided not to tell him about his illness. In 1976 she told Erdős. Sós was sure that Turán was ‘too much in love with life’ and would have fallen into despair at the news of his fatal illness, and would not have been able to work properly. Erdős said that Turán did not lose his spirit even in the Nazi camps and did brilliant work there. Erdős regretted that Turán had been kept unaware of his illness because he had put off certain works and books 'for later', hoping that he would soon feel better, and in the end was never able to finish them. Turán died in Budapest on 26 September 1976 of leukemia, aged 66.[6]
Turán worked primarily in number theory,[6] but also did much work in analysis and graph theory.[7]
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
lnlnn
lnlnn
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. 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."
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.
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." 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.
Turán developed the power sum method to work on the Riemann hypothesis. The method deals with inequalities giving lower bounds for sums of the form
max\nu=m+1,...,m+n\left|
| n | |
| \sum | |
| j=1 |
bj
| \nu | |
| z | |
| j |
\right|,
Aside from 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]