19 May 1949|
|Died||29 September 2008
|Fields||Mathematics and Computer science|
|Institutions||Eötvös Loránd University|
|Alma mater||Eötvös Loránd University|
|Known for||Combinatorial geometry
Combinatorial set theory
He has an Erdős number of one.
György Elekes (19 May 1949 – 29 September 2008) was a Hungarian mathematician and computer scientist who specialized in Combinatorial geometry and Combinatorial set theory. He may be best known for his work in the field that would eventually be called Additive Combinatorics. Particularly notable was his "ingenious" application of the Szemerédi–Trotter theorem to improve the best known lower bound for the sum-product problem. He also proved that any polynomial-time algorithm approximating the volume of convex bodies must have a multiplicative error, and the error grows exponentially on the dimension. With Micha Sharir he set up a framework which eventually led Guth and Katz to the solution of the Erdős distinct distances problem.
After graduating from the mathematics program at Fazekas Mihály Gimnázium (i.e., "Fazekas Mihály high school" in Budapest, which is known for its excellence, especially in mathematics), Elekes studied mathematics at the Eötvös Loránd University. Upon completing his degree, he joined the faculty in the Department of Analysis at the university. In 1984, he joined the newly forming Department of Computer Science, which was being headed by László Lovász. Elekes was promoted to full professor in 2005. He received the Doctor of Mathematical Sciences title from the Hungarian Academy of Sciences in 2001.
Elekes started his mathematical work in combinatorial set theory, answering some questions posed by Erdős and Hajnal. One of his results states that if the set of infinite subsets of the set of natural numbers is split into countably many parts, then in one of them, there is a solution of the equation A∪B=C. His interest later switched to another favorite topic of Erdős, discrete geometry and geometric algorithm theory. In 1986 he proved that if a deterministic polynomial algorithm computes a number V(K) for every convex body K in any Euclidean space given by a separation oracle such that V(K) always at least vol(K), the volume of K, then for every large enough dimension n, there is a convex body in the n-dimensional Euclidean space such that V(K)>20.99nvol(K). That is, any polynomial-time estimate the volume of K must be inaccurate by at least an exponential factor.
- "Obituary". Eötvös Loránd University. Retrieved 21 March 2010.
- Tao, Terence; Vu, Van H. (2010). "8.3". Additive Combinatorics (Paperback ed.). Cambridge University Press. p. 315. ISBN 978-0-521-13656-3.
- Elekes, György (1997). "On the number of sums and products". Acta Arith. 81: 365–367.
- Elekes, György (1986). "A geometric inequality and the complexity of computing volume". Discrete and Computational Geometry 1: 289–292. doi:10.1007/bf02187701.
- The Erdős distance problem
- Elekes, György; Erdős, Paul; Hajnal, András (1978). "On some partition properties of families of sets". Studia Scientiarum Mathematicarum Hungarica: 151–155.