Pál Turán
   HOME

TheInfoList



OR:

Pál Turán (; 18 August 1910 – 26 September 1976) also known as Paul Turán, was a Hungarian mathematician who worked primarily in extremal combinatorics. He had a long collaboration with fellow Hungarian mathematician Paul Erdős, lasting 46 years and resulting in 28 joint papers.


Life and education

Turán was born into a
Jewish Jews ( he, יְהוּדִים, , ) or Jewish people are an ethnoreligious group and nation originating from the Israelites Israelite origins and kingdom: "The first act in the long drama of Jewish history is the age of the Israelites""The ...
family in
Budapest Budapest (, ; ) is the capital and most populous city of Hungary. It is the ninth-largest city in the European Union by population within city limits and the second-largest city on the Danube river; the city has an estimated population ...
on 18 August 1910.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 A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, th ...
in 1933 and 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 ''Numerus clausus'' ("closed number" in Latin) is one of many methods used to limit the number of students who may study at a university. In many cases, the goal of the ''numerus clausus'' is simply to limit the number of students to the maximum ...
, and could not get a university job for several years. He was sent to labour service at various times from 1940-44. 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. Turán became associate professor at the
University of Budapest A university () is an institution of higher (or tertiary) education and research which awards academic degrees in several academic disciplines. Universities typically offer both undergraduate and postgraduate programs. In the United States, th ...
in 1945 and full professor in 1949. Turán married twice. He married Edit (Klein) Kóbor in 1939; they had one son, Róbert. His second marriage was to Vera Sós, a mathematician, in 1952; they had two children, György and Tamás.


Death

Turán died in
Budapest Budapest (, ; ) is the capital and most populous city of Hungary. It is the ninth-largest city in the European Union by population within city limits and the second-largest city on the Danube river; the city has an estimated population ...
on 26 September 1976 of
leukemia Leukemia ( also spelled leukaemia and pronounced ) is a group of blood cancers that usually begin in the bone marrow and result in high numbers of abnormal blood cells. These blood cells are not fully developed and are called ''blasts'' or ...
, aged 66.


Work

Turán worked primarily in
number theory Number theory (or arithmetic or higher arithmetic in older usage) is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. German mathematician Carl Friedrich Gauss (1777–1855) said, "Mat ...
, but also did much work in
analysis Analysis ( : analyses) is the process of breaking a complex topic or substance into smaller parts in order to gain a better understanding of it. The technique has been applied in the study of mathematics and logic since before Aristotle (3 ...
and
graph theory In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are conn ...
.


Number theory

In 1934, Turán used the Turán sieve to give a new and very simple proof of a 1917
result A result (also called upshot) is the final consequence of a sequence of actions or events expressed qualitatively or quantitatively. Possible results include advantage, disadvantage, gain, injury, loss, value and victory. There may be a range ...
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 In mathematics, Probabilistic number theory is a subfield of number theory, which explicitly uses probability to answer questions about the integers and integer-valued functions. One basic idea underlying it is that different prime numbers are, in ...
". The Turán–Kubilius inequality is a generalization of this work. 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 In number theory, primes in arithmetic progression are any sequence of at least three prime numbers that are consecutive terms in an arithmetic progression. An example is the sequence of primes (3, 7, 11), which is given by a_n = 3 + 4n for 0 \le n ...
. 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."


Analysis

Much of Turán's work in
analysis Analysis ( : analyses) is the process of breaking a complex topic or substance into smaller parts in order to gain a better understanding of it. The technique has been applied in the study of mathematics and logic since before Aristotle (3 ...
was tied to his number theory work. Outside of this he proved
Turán's inequalities In mathematics, Turán's inequalities are some inequalities for Legendre polynomials found by (and first published by ). There are many generalizations to other polynomials, often called Turán's inequalities, given by and other authors. If is ...
relating the values of the
Legendre polynomials In physical science and mathematics, Legendre polynomials (named after Adrien-Marie Legendre, who discovered them in 1782) are a system of complete and orthogonal polynomials, with a vast number of mathematical properties, and numerous applica ...
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." The field is known more briefly today as
extremal graph theory Extremal graph theory is a branch of combinatorics, itself an area of mathematics, that lies at the intersection of extremal combinatorics and graph theory. In essence, extremal graph theory studies how global properties of a graph influence local ...
. 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 In the mathematical field of graph theory, a complete graph is a simple undirected graph in which every pair of distinct vertices is connected by a unique edge. A complete digraph is a directed graph in which every pair of distinct vertices is ...
''Kr'' as a subgraph. He invented the
Turán graph The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to di ...
, a generalization of the
complete bipartite graph In the mathematical field of graph theory, a complete bipartite graph or biclique is a special kind of bipartite graph where every vertex of the first set is connected to every vertex of the second set..Electronic edition page 17. Graph theory i ...
, 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. The method deals with inequalities giving lower bounds for sums of the form : \max_ \left , \sum_^n b_j z_j^\nu \right , , hence the name "power sum". Aside from its applications in analytic number theory, it has been used in complex analysis,
numerical analysis Numerical analysis is the study of algorithms that use numerical approximation (as opposed to symbolic manipulations) for the problems of mathematical analysis (as distinguished from discrete mathematics). It is the study of numerical methods ...
, differential equations,
transcendental number theory Transcendental number theory is a branch of number theory that investigates transcendental numbers (numbers that are not solutions of any polynomial equation with rational coefficients), in both qualitative and quantitative ways. Transcendence ...
, and estimating the number of zeroes of a function in a disk.


Publications

* * Deals with the power sum method. *


Honors

* Hungarian Academy of Sciences elected corresponding member in 1948 and ordinary member in 1953 * Kossuth Prize in 1948 and 1952 * Tibor Szele Prize of János Bolyai Mathematical Society 1975


Notes


External links

* *
Paul Turán memorial lectures
at the Rényi Institute {{DEFAULTSORT:Turan, Pal 1910 births 1976 deaths 20th-century Hungarian mathematicians Austro-Hungarian mathematicians Graph theorists Number theorists Members of the Hungarian Academy of Sciences Hungarian Jews Deaths from leukemia Deaths from cancer in Hungary Eötvös Loránd University alumni Hungarian World War II forced labourers