• Thumbnail for 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...
    19 KB (2,194 words) - 02:30, 20 September 2024
  • Thumbnail for Turán graph
    (i.e. when s = 0 {\displaystyle s=0} ). Turán graphs are named after Pál Turán, who used them to prove Turán's theorem, an important result in extremal...
    10 KB (1,262 words) - 13:42, 15 July 2024
  • Thumbnail for Paul Erdős
    Paul Erdős (redirect from Pál Erdös)
    Paul Erdős (Hungarian: Erdős Pál [ˈɛrdøːʃ ˈpaːl]; 26 March 1913 – 20 September 1996) was a Hungarian mathematician. He was one of the most prolific mathematicians...
    50 KB (5,348 words) - 07:28, 7 November 2024
  • graphs. Turán's theorem, and the Turán graphs giving its extreme case, were first described and studied by Hungarian mathematician Pál Turán in 1941....
    20 KB (3,258 words) - 16:52, 5 June 2024
  • Erdős conjecture on arithmetic progressions) posed by Paul Erdős and Pál Turán in 1941. It concerns additive bases, subsets of natural numbers with the...
    10 KB (1,730 words) - 07:34, 29 June 2024
  • Thumbnail for Alfréd Rényi
    Pach, János (2010-12-16), Anastasatos' Conjecture, retrieved 2017-01-21. Pál Turán (1970). "The Work of Alfréd Rényi". Matematikai Lapok 21: 199–210. "Rényi...
    10 KB (1,076 words) - 06:24, 26 December 2023
  • Thumbnail for Turán's brick factory problem
    some special cases solved. During World War II, Hungarian mathematician Pál Turán was forced to work in a brick factory, pushing wagon loads of bricks from...
    13 KB (1,513 words) - 08:14, 11 January 2024
  • Thumbnail for Turán sieve
    are expressed by congruences. It was developed by Pál Turán in 1934. In terms of sieve theory the Turán sieve is of combinatorial type: deriving from a...
    3 KB (509 words) - 20:03, 22 July 2024
  • function.: 305–308  The theorem was proved in a special case in 1934 by Pál Turán and generalized in 1956 and 1964 by Jonas Kubilius.: 316  This formulation...
    3 KB (387 words) - 15:58, 17 June 2024
  • subset E is itself an interval, the inequality was proved by Pál Turán and is known as Turán's lemma. This inequality also extends to L p ( T ) ,   0 ≤ p...
    7 KB (1,250 words) - 18:12, 23 October 2024
  • was proved by Paul Erdős and Pál Turán in 1948. Let μ be a probability measure on the unit circle R/Z. The Erdős–Turán inequality states that, for any...
    3 KB (456 words) - 09:21, 24 February 2023
  • Mohács Pál Turán (1910–1976), also known as Paul Turán, Hungarian mathematician Pál Várhidi (1931–2015), Hungarian football player and manager Pál Völner...
    3 KB (402 words) - 23:14, 4 May 2024
  • goes to infinity. A simple proof to the result was given by Pál Turán, who used the Turán sieve to prove that ∑ n ≤ x | ω ( n ) − log ⁡ log ⁡ x | 2 ≪...
    5 KB (628 words) - 03:05, 15 October 2024
  • Thumbnail for Vera T. Sós
    Erdős and Alfréd Rényi. She also collaborated frequently with her husband Pál Turán, an analyst, number theorist, and combinatorist. Until 1987, she worked...
    9 KB (913 words) - 19:27, 20 September 2024
  • Thumbnail for Crossing number (graph theory)
    drawing. The study of crossing numbers originated in Turán's brick factory problem, in which Pál Turán asked for a factory plan that minimized the number...
    27 KB (3,162 words) - 10:43, 12 October 2024
  • painter and sculptor Fatih Turan (born 1993), Turkish footballer Frigyes Turán (born 1974), Hungarian rally driver Gülistan Turan (born 1997), Turkish female...
    2 KB (284 words) - 14:05, 7 April 2024
  • Thumbnail for Endre Szemerédi
    known for his proof from 1975 of an old conjecture of Paul Erdős and Pál Turán: if a sequence of natural numbers has positive upper density then it contains...
    16 KB (1,473 words) - 18:40, 29 October 2024
  • In mathematics, Turán's inequalities are some inequalities for Legendre polynomials found by Pál Turán (1950) (and first published by Szegö (1948)). There...
    2 KB (316 words) - 10:07, 13 August 2023
  • the Faculty of Sciences of the Eötvös Loránd University, Budapest. With Pál Turán, Halász proved zero density results on the roots of the Riemann zeta function...
    3 KB (201 words) - 14:17, 22 September 2024
  • Sudakov Endre Szemerédi Terence Tao Carsten Thomassen Jacques Touchard Pál Turán Bartel Leendert van der Waerden Herbert Wilf Richard Wilson Doron Zeilberger...
    9 KB (683 words) - 08:34, 14 July 2024
  • Thumbnail for Dénes Kőnig
    Egyed, Paul Erdős, Tibor Gallai, György Hajós, József Kraus, Tibor Szele, Pál Turán, Endre Vázsonyi, and many others. He went on to write the first book on...
    8 KB (796 words) - 07:46, 18 November 2024
  • Thumbnail for Golomb ruler
    optimal Golomb rulers. The following construction, due to Paul Erdős and Pál Turán, produces a Golomb ruler for every odd prime p. 2 p k + ( k 2 mod p )...
    17 KB (1,471 words) - 09:25, 20 December 2023
  • n0 (this conjecture is occasionally–though incorrectly–attributed to Pál Turán). This was then disproved by Haselgrove (1958), who showed that T(n) takes...
    11 KB (1,820 words) - 09:49, 27 June 2024
  • progression. These sequences had been studied in 1936 by Paul Erdős and Pál Turán, who conjectured that they must be sparse. However, in 1942, Raphaël Salem...
    30 KB (3,359 words) - 16:11, 11 November 2024
  • Thumbnail for László Rátz
    Anonymous group in Budapest, Pál Erdős (Paul Erdős) (Hungarian: Erdős Pál), Pál Turán (Paul Turán) (Hungarian: Turán Pál), György Szekeres (George Szekeres)...
    27 KB (3,196 words) - 08:19, 5 November 2024
  • Thumbnail for Erdős number
    András Hajnal 56 Ralph Faudree 50 Richard Schelp 42 Cecil C. Rousseau 35 Vera T. Sós 35 Alfréd Rényi 32 Pál Turán 30 Endre Szemerédi 29 Ronald Graham 28...
    33 KB (3,609 words) - 15:27, 29 October 2024
  • Thumbnail for Lipót Fejér
    mathematicians such as John von Neumann, Paul Erdős, George Pólya and Pál Turán. Thanks to Fejér, Hungary has developed a strong mathematical school:...
    13 KB (1,288 words) - 14:00, 13 July 2024
  • Thumbnail for Riemann hypothesis
    to some speculation about a relationship with the Riemann hypothesis. Pál Turán (1948) showed that if the functions ∑ n = 1 N n − s {\displaystyle \sum...
    126 KB (16,772 words) - 04:59, 17 November 2024
  • called null graph. Turán 1.  Pál Turán 2.  A Turán graph is a balanced complete multipartite graph. 3.  Turán's theorem states that Turán graphs have the...
    108 KB (15,920 words) - 19:45, 30 October 2024
  • July 16 – David Lack (died 1973), English ornithologist. August 18 – Pál Turán (died 1976), Hungarian mathematician. August 28 – C. Doris Hellman (died...
    17 KB (1,776 words) - 17:02, 16 June 2024