Imre Bárány

Imre Bárány (Mátyásföld, 7 December 1947) is a Hungarian mathematician, working in combinatorics and discrete geometry. He works at the Rényi Mathematical Institute of the Hungarian Academy of Sciences, and has a part-time job at University College London.

Notable results

He gave a surprisingly simple alternative proof of Lovász's theorem on Kneser graphs.^[1]
He gave a new proof to the Borsuk–Ulam theorem.^[1]
Barany gave a colored version of Carathéodory's theorem.^[1]
He solved an old problem of Sylvester^[2] on the probability of random point sets in convex position.^[3]
With Vu proved a central limit theorem on random points in convex bodies.^[1]
With Füredi he gave an algorithm for mental poker.^[1]
With Füredi he proved that no deterministic polynomial time algorithm determines the volume of convex bodies in dimension d within a multiplicative error d^d.
With Füredi and Pach he proved the following six circle conjecture of Fejes Tóth: if in a planar circle packing each circle is tangent to at least 6 other circles, then either it is the hexagonal system of circles with identical radii, or there are circles with arbitrarily small radius.

Bárány received the Mathematical Prize (now Paul Erdős Prize) of the Hungarian Academy of Sciences in 1985. He was an invited speaker at the Combinatorics session of the International Congress of Mathematicians, in Beijing, 2002.^[4] He was an Erdős Lecturer at Hebrew University of Jerusalem in 2004. He was elected a corresponding member of the Hungarian Academy of Sciences (2010). In 2012 he became a fellow of the American Mathematical Society.^[5]

He is an Editorial Board member for the journals Combinatorica,^[6] Mathematika,^[7] and the Online Journal of Analytic Combinatorics".^[8] He is area editor of the journal Mathematics of Operations Research.^[9]

1 2 3 4 5 "DBLP Bibliography". Universitat Trier. Retrieved 29 January 2010.
↑ J. J. Sylvester, Problem 1491. The Educational Times, April, 1864, London
↑ Bárány, Imre, Sylvester's question: the probability that n points are in convex position. Annals of Probability, vol. 27 (1999), no. 4, pp. 2020–2034
↑ Invited Speakers for ICM2002, Notices of the American Mathematical Society, vol 48 (2001), no. 11, pp. 1343–1345
↑ List of Fellows of the American Mathematical Society, retrieved 2012-11-03.
↑ Editorial Board, Combinatorica, Springer-Verlag. Accessed January 23, 2010
↑ Editorial Board Archived 2009-11-25 at the Wayback Machine., Mathematika, London Mathematical Society. Accessed January 23, 2010.
↑ Editorial Board, Online Journal of Analytic Combinatorics. Accessed January 23, 2010.
↑ Area editors Archived 2010-04-07 at the Wayback Machine., Mathematics of Operations Research. Accessed April 5, 2010.

This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.