Noga Alon

from Wikipedia, the free encyclopedia
Noga Alon (2008)

Noga Alon ( Hebrew נוגה אלון; Pseudonym Alon Nilli ; *  1956 ) is an Israeli mathematician ( combinatorics ) and computer scientist .

Life

Alon received his PhD in 1983 from the Hebrew University of Jerusalem with Micha Perles ( Extremal Problems in Combinatorics ). He is a tree knight professor of mathematics and computer science at Tel Aviv University . Alon was a visiting scientist at the Institute for Advanced Study , the IBM Almaden Research Center , Bell Laboratories and Microsoft Research .

Alon introduced the necklace splitting problem, which is about the fair division (with regard to the colors) of the pearls of a necklace (open at the neck) with t colors of the pearls under k "thieves" with the help of cuts ( k divides the total number and the number of pearls of each color). With the help of the Borsuk-Ulam theorem , Alon and West showed that there is always a fair division into t (k-1) sections.

In 1994 he and Raphael Yuster and Uri Zwick introduced the color coding method for algorithms in graph theory.

He proved (with co-authors since 1989) the combinatorial zero theorem , which has numerous applications in additive number theory and combinatorics . (The polynomial method is also used in connection with these and similar applications ).

1985 with RB Boppana he tightened a result of Alexander Alexandrowitsch Rasborow about monotonous circuit complexity in the clique problem from superpolynomial to exponential.

He was invited speaker at the International Congress of Mathematicians (ICM) in Kyoto in 1990 ( Non-constructive proofs in combinatorics ) and gave a plenary lecture at the ICM 2002 in Beijing ( Discrete Mathematics: Methods and Challenges ). In 1996 he gave one of the plenary lectures at the second European Congress of Mathematicians in Budapest ( Randomness and pseudorandomness in discrete mathematics ). In 1989 he received the Erdős Prize , the Feher Prize in 1991, the Pólya Prize in 2000 and the Landau Prize and the Gödel Prize in 2005 . In 2001 he received the Bruno Memorial Award and in 2008 the Israel Prize in Mathematics, and in 2019 the Paris Kanellakis Prize . He has been a member of the Israel Academy of Sciences since 1997 and a member of the Academia Europaea since 2008 . In 2011/12 and 2012/13 he was on the Abel Prize Committee. In 2016 he became a Fellow of the Association for Computing Machinery . He is a fellow of the American Mathematical Society .

He also publishes under the pseudonym Alon Nilli.

Fonts

Web links

Individual evidence

  1. ^ Noga Alon: Splitting Necklaces , Advances in Mathematics, Vol. 63, 1987, pp. 247-253, Alon, DB West The Borsuk-Ulam-Theorem and the Bisection of necklaces , Proc. AMS Vol. 98, 1986
  2. ↑ Alon, Michael Tarsi: A nowhere-zero point in linear mappings , Combinatorica, Vol. 9, 1989, p. 393, expanded by Alon, Melvyn Nathanson, Imre Rusza: The polynomial method in restricted sums of congruence classes , Journal of Number Theory, Vol. 56, 1996, p. 404, Alon: The combinatorial Nullstellsatz , Combinatorics, Probability and Computing, Vol. 8, 1999, pp. 7-29
  3. ↑ Stasys Jukna: Extremal Combinatorics. Springer 2011, p. 223 ff.
  4. ↑ Noga Alon, RB Boppana, The monotone circuit complexity of Boolean functions, Combinatorica, Volume 7, 1987, pp 1-22
  5. ↑ for example Nesetril, Rödl (ed.) Mathematics of Ramsey Theory, Springer 1990, p. 5, there by A. Nilli Shelah's proof of the Hales-Jewett-Theorem , p. 150. Photo in Martin Aigner , Günter M. Ziegler The book of evidence , Springer Verlag, 2002, chapter 16
personal data
SURNAME Alon, Noga
ALTERNATIVE NAMES Nilli, Alon (pseudonym); נוגה אלון (Hebrew)
BRIEF DESCRIPTION Israeli mathematician (combinatorics) and computer scientist
DATE OF BIRTH 1956