György Elekes
Mathematician, Academic
1949 –
Who is György Elekes?
György Elekes was a 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.
We need you!
Help us build the largest biographies collection on the web!
- Born
- 1949
Budapest - Profession
- Education
- Eötvös Loránd University
- Lived in
- Fót
Submitted
on July 23, 2013
Citation
Use the citation below to add to a bibliography:
Style:MLAChicagoAPA
"György Elekes." Biographies.net. STANDS4 LLC, 2024. Web. 8 Jun 2024. <https://www.biographies.net/people/en/gyorgy_elekes>.
Discuss this György Elekes biography with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In