Imre Bárány
Quick Facts
Biography
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.
- He gave a new proof to the Borsuk–Ulam theorem.
- Barany gave a colored version of Carathéodory's theorem.
- He solved an old problem of Sylvester on the probability of random point sets in convex position.
- With Vu proved a central limit theorem on random points in convex bodies.
- With Füredi he gave an algorithm for mental poker.
- With Füredi he proved that no deterministic polynomial time algorithm determines the volume of convex bodies in dimension d within a multiplicative error dd.
- 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.
Career
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. He was elected a corresponding member of the Hungarian Academy of Sciences (2010). In 2012 he became a fellow of the American Mathematical Society.
He is an Editorial Board member for the journals Combinatorica, Mathematika, and the Online Journal of Analytic Combinatorics".
He is area editor of the journal Mathematics of Operations Research.