Pál Turán
Pál Turán (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.
Pál Turán | |
|---|---|
| Born | 18 August 1910 |
| Died | 26 September 1976 (aged 66) |
| Nationality | Hungarian |
| Alma mater | Eötvös Loránd University |
| Known for | Extremal graph theory Turán graph Turán number Turán's brick factory problem 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 conjecture on additive bases 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) |
| Scientific career | |
| Fields | Mathematics |
| Institutions | Eötvös Loránd University |
| Doctoral advisor | Lipót Fejér |
| Doctoral students | László Babai János Pintz Peter Szüsz |
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.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.